downloading reverse dependencies ... downloading BayesianNetwork_0.3.2.tar.gz ... ok downloading BayesNetBP_1.6.1.tar.gz ... ok downloading bayesvl_1.0.0.tar.gz ... ok downloading bnmonitor_0.2.2.tar.gz ... ok downloading bnpa_0.3.0.tar.gz ... ok downloading bnRep_0.0.5.tar.gz ... ok downloading BNrich_0.1.1.tar.gz ... ok downloading BNSL_0.1.4.tar.gz ... ok downloading bnviewer_0.1.6.tar.gz ... ok downloading cia_1.0.0.tar.gz ... ok downloading criticality_0.9.3.tar.gz ... ok downloading dagHMM_0.1.1.tar.gz ... ok downloading dbnlearn_0.1.0.tar.gz ... ok downloading dbnR_0.7.9.tar.gz ... ok downloading DPI_2025.8.tar.gz ... ok downloading GroupBN_1.2.0.tar.gz ... ok downloading imbalance_1.0.2.1.tar.gz ... ok downloading mDAG_1.2.2.tar.gz ... ok downloading MoTBFs_1.4.2.tar.gz ... ok downloading MRPC_3.1.0.tar.gz ... ok downloading OrdCD_1.1.2.tar.gz ... ok downloading pchc_1.3.tar.gz ... ok downloading r.blip_1.1.tar.gz ... ok downloading rPACI_0.2.2.tar.gz ... ok downloading SELF_0.1.1.tar.gz ... ok downloading StratifiedBalancing_0.3.0.tar.gz ... ok downloading CompareCausalNetworks_0.2.6.2.tar.gz ... ok downloading dsld_0.2.2.tar.gz ... ok downloading gRain_1.4.5.tar.gz ... ok downloading OGI_1.0.0.tar.gz ... ok downloading ParallelPC_1.2.tar.gz ... ok downloading rbmn_0.9-6.tar.gz ... ok downloading stagedtrees_2.3.0.tar.gz ... ok installing dependencies ‘backShift’, ‘bigreadr’, ‘bnclassify’, ‘bnlearn’, ‘bnviewer’, ‘bruceR’, ‘CAM’, ‘ClustOfVar’, ‘CompareCausalNetworks’, ‘cyjShiny’, ‘dcov’, ‘fairml’, ‘fairness’, ‘flare’, ‘freqparcoord’, ‘gRain’, ‘gRim’, ‘InvariantCausalPrediction’, ‘mgm’, ‘PCAmixdata’, ‘qeML’, ‘qtlnet’, ‘RcppArmadillo’, ‘regtools’, ‘smotefamily’ Warning: package ‘CAM’ is not available for this version of R A version of this package for your version of R might be available elsewhere, see the ideas at https://cran.r-project.org/doc/manuals/r-devel/R-admin.html#Installing-packages also installing the dependencies ‘interactions’, ‘polyreg’, ‘toweranNA’, ‘partools’, ‘FOCI’ begin installing package ‘interactions’ begin installing package ‘polyreg’ begin installing package ‘FOCI’ begin installing package ‘cyjShiny’ begin installing package ‘RcppArmadillo’ begin installing package ‘bnclassify’ begin installing package ‘PCAmixdata’ begin installing package ‘smotefamily’ begin installing package ‘mgm’ begin installing package ‘bigreadr’ begin installing package ‘CompareCausalNetworks’ begin installing package ‘InvariantCausalPrediction’ begin installing package ‘backShift’ begin installing package ‘flare’ begin installing package ‘fairml’ begin installing package ‘freqparcoord’ begin installing package ‘fairness’ begin installing package ‘bnlearn’ * installing *source* package ‘FOCI’ ... ** this is package ‘FOCI’ version ‘0.1.3’ ** package ‘FOCI’ successfully unpacked and MD5 sums checked ** using staged installation ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (FOCI) * installing *source* package ‘polyreg’ ... ** this is package ‘polyreg’ version ‘0.8.0’ ** package ‘polyreg’ 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 ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (polyreg) * installing *source* package ‘smotefamily’ ... ** this is package ‘smotefamily’ version ‘1.4.0’ ** package ‘smotefamily’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** byte-compile and prepare package for lazy loading ** 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 (smotefamily) * installing *source* package ‘PCAmixdata’ ... ** this is package ‘PCAmixdata’ version ‘3.1’ ** package ‘PCAmixdata’ successfully unpacked and MD5 sums checked ** using staged installation ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (PCAmixdata) begin installing package ‘ClustOfVar’ * installing *source* package ‘cyjShiny’ ... ** this is package ‘cyjShiny’ version ‘1.0.42’ ** package ‘cyjShiny’ successfully unpacked and MD5 sums checked ** using staged installation ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (cyjShiny) * installing *source* package ‘freqparcoord’ ... ** this is package ‘freqparcoord’ version ‘1.0.1’ ** package ‘freqparcoord’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** 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 (freqparcoord) * installing *source* package ‘InvariantCausalPrediction’ ... ** this is package ‘InvariantCausalPrediction’ version ‘0.8’ ** package ‘InvariantCausalPrediction’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** byte-compile and prepare package for lazy loading ** 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 (InvariantCausalPrediction) * installing *source* package ‘backShift’ ... ** this is package ‘backShift’ version ‘0.1.4.3’ ** package ‘backShift’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmppxeX0V/R.INSTALL39e1244035d78c/backShift/src' gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c backShift_init.c -o backShift_init.o gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c evallf.c -o evallf.o evallf.c: In function ‘evallf’: evallf.c:21:34: warning: missing braces around initializer [-Wmissing-braces] 21 | double del[MAX_VARS][MAX_VARS]={0.0}, subdel[MAX_VARS][MAX_VARS]={0.0},c,d; | ^ | { } evallf.c:21:68: warning: missing braces around initializer [-Wmissing-braces] 21 | double del[MAX_VARS][MAX_VARS]={0.0}, subdel[MAX_VARS][MAX_VARS]={0.0},c,d; | ^ | { } gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c ffdiag.c -o ffdiag.o gcc-14 -std=gnu23 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o backShift.so backShift_init.o evallf.o ffdiag.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmppxeX0V/R.INSTALL39e1244035d78c/backShift/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-backShift/00new/backShift/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** 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 (backShift) * installing *source* package ‘ClustOfVar’ ... ** this is package ‘ClustOfVar’ version ‘1.2’ ** package ‘ClustOfVar’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data ** byte-compile and prepare package for lazy loading ** 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 (ClustOfVar) * installing *source* package ‘CompareCausalNetworks’ ... ** this is package ‘CompareCausalNetworks’ version ‘0.2.6.2’ ** package ‘CompareCausalNetworks’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data *** moving datasets to lazyload DB ** demo ** inst ** byte-compile and prepare package for lazy loading ** 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 (CompareCausalNetworks) * installing *source* package ‘bigreadr’ ... ** this is package ‘bigreadr’ version ‘0.2.5’ ** package ‘bigreadr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmpo1TpOr/R.INSTALL39e10b2a8b227e/bigreadr/src' g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c nlines-split.cpp -o nlines-split.o g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o bigreadr.so RcppExports.o nlines-split.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmpo1TpOr/R.INSTALL39e10b2a8b227e/bigreadr/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-bigreadr/00new/bigreadr/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** 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 (bigreadr) * installing *source* package ‘fairml’ ... ** this is package ‘fairml’ version ‘0.9’ ** package ‘fairml’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data *** moving datasets to lazyload DB ** byte-compile and prepare package for lazy loading ** 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 (fairml) * installing *source* package ‘interactions’ ... ** this is package ‘interactions’ version ‘1.2.0’ ** package ‘interactions’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (interactions) begin installing package ‘bruceR’ * installing *source* package ‘flare’ ... ** this is package ‘flare’ version ‘1.7.0.2’ ** package ‘flare’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmp35WbZh/R.INSTALL39e12214862dae/flare/src' gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c SFGen.c -o SFGen.o gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c euc_proj.c -o euc_proj.o gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c mymath.c -o mymath.o mymath.c: In function ‘max_fabs_vc’: mymath.c:141:11: warning: variable ‘cnt’ set but not used [-Wunused-but-set-variable] 141 | int i,cnt; | ^~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c registerDynamicSymbol.c -o registerDynamicSymbol.o gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c slim_dantzig_ladm_scr.c -o slim_dantzig_ladm_scr.o slim_dantzig_ladm_scr.c: In function ‘slim_dantzig_ladm_scr’: slim_dantzig_ladm_scr.c:262:24: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 262 | double T,T1,T2,rho,zero,eps,eps1,eps2,ilambda; | ^~~~ slim_dantzig_ladm_scr.c:261:15: warning: variable ‘ndata’ set but not used [-Wunused-but-set-variable] 261 | int j,k,m,ndata,dim,nlambda,ite1,ite2,ite,max_ite0,max_ite1,max_ite2,num_scr,num_scr1,num_scr2,num_scr1_tmp,num_scr2_tmp,flag,flag1,flag2; | ^~~~~ slim_dantzig_ladm_scr.c: In function ‘slim_dantzig_ladm_scr2’: slim_dantzig_ladm_scr.c:411:21: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 411 | double T,T1,rho,zero,eps,eps1,ilambda; | ^~~~ slim_dantzig_ladm_scr.c:410:15: warning: variable ‘ndata’ set but not used [-Wunused-but-set-variable] 410 | int j,k,m,ndata,dim,nlambda,ite1,ite,max_ite0,max_ite1,num_scr,num_scr1,num_scr1_tmp,flag,flag1; | ^~~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c slim_lad_ladm_scr_btr.c -o slim_lad_ladm_scr_btr.o slim_lad_ladm_scr_btr.c: In function ‘slim_lad_ladm_scr_btr’: slim_lad_ladm_scr_btr.c:236:24: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 236 | double T,T1,T2,rho,zero,eps,eps1,eps2,ilambda,nrholamb; | ^~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c slim_lasso_ladm_scr.c -o slim_lasso_ladm_scr.o slim_lasso_ladm_scr.c: In function ‘lasso_ladm_scr’: slim_lasso_ladm_scr.c:12:58: warning: variable ‘epsT’ set but not used [-Wunused-but-set-variable] 12 | double gap_ext,max_dif,beta_dif,threshold,tmpd,ratio,epsT; | ^~~~ slim_lasso_ladm_scr.c:12:52: warning: variable ‘ratio’ set but not used [-Wunused-but-set-variable] 12 | double gap_ext,max_dif,beta_dif,threshold,tmpd,ratio,epsT; | ^~~~~ slim_lasso_ladm_scr.c: In function ‘slim_lasso_ladm_scr’: slim_lasso_ladm_scr.c:183:24: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 183 | double T,T1,T2,rho,zero,eps,eps1,eps2,ilambda; | ^~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c slim_lq_ladm_scr_btr.c -o slim_lq_ladm_scr_btr.o slim_lq_ladm_scr_btr.c: In function ‘slim_lq_ladm_scr_btr’: slim_lq_ladm_scr_btr.c:242:24: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 242 | double T,T1,T2,rho,zero,eps,eps1,eps2,ilambda,nrholamb,qrtn; | ^~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c slim_sqrt_ladm_scr.c -o slim_sqrt_ladm_scr.o slim_sqrt_ladm_scr.c: In function ‘sqrt_ladm_scr’: slim_sqrt_ladm_scr.c:12:92: warning: variable ‘epsT’ set but not used [-Wunused-but-set-variable] 12 | double gap_ext,max_dif,alp_dif,beta_dif,mu_dif,threshold,tmpd,alp_tild_sq,alp_th,ratio,epsT; | ^~~~ slim_sqrt_ladm_scr.c:12:86: warning: variable ‘ratio’ set but not used [-Wunused-but-set-variable] 12 | double gap_ext,max_dif,alp_dif,beta_dif,mu_dif,threshold,tmpd,alp_tild_sq,alp_th,ratio,epsT; | ^~~~~ slim_sqrt_ladm_scr.c: In function ‘slim_sqrt_ladm_scr’: slim_sqrt_ladm_scr.c:285:24: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 285 | double T,T1,T2,rho,zero,eps,eps1,eps2,ilambda,sqrtn,nrholamb; | ^~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c slimh.c -o slimh.o gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c sugm_clime_ladm_scr.c -o sugm_clime_ladm_scr.o sugm_clime_ladm_scr.c: In function ‘sugm_clime_ladm_scr’: sugm_clime_ladm_scr.c:11:24: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 11 | double T,T1,T2,rho,zero,eps,eps1,eps2,ilambda; | ^~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c sugm_tiger_ladm_scr.c -o sugm_tiger_ladm_scr.o sugm_tiger_ladm_scr.c: In function ‘tiger_lasso_ladm_scr’: sugm_tiger_ladm_scr.c:12:58: warning: variable ‘epsT’ set but not used [-Wunused-but-set-variable] 12 | double gap_ext,max_dif,beta_dif,threshold,tmpd,ratio,epsT,tau0,tau1,tmp; | ^~~~ sugm_tiger_ladm_scr.c:12:52: warning: variable ‘ratio’ set but not used [-Wunused-but-set-variable] 12 | double gap_ext,max_dif,beta_dif,threshold,tmpd,ratio,epsT,tau0,tau1,tmp; | ^~~~~ sugm_tiger_ladm_scr.c: In function ‘sugm_tiger_ladm_scr’: sugm_tiger_ladm_scr.c:205:24: warning: variable ‘zero’ set but not used [-Wunused-but-set-variable] 205 | double T,T1,T2,rho,zero,eps,eps1,eps2,ilambda,sqrtn,nrholamb,tau0; | ^~~~ gcc-14 -std=gnu23 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o flare.so SFGen.o euc_proj.o mymath.o registerDynamicSymbol.o slim_dantzig_ladm_scr.o slim_lad_ladm_scr_btr.o slim_lasso_ladm_scr.o slim_lq_ladm_scr_btr.o slim_sqrt_ladm_scr.o slimh.o sugm_clime_ladm_scr.o sugm_tiger_ladm_scr.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmp35WbZh/R.INSTALL39e12214862dae/flare/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-flare/00new/flare/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 (flare) * installing *source* package ‘mgm’ ... ** this is package ‘mgm’ version ‘1.2-15’ ** package ‘mgm’ 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 ** 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 (mgm) * installing *source* package ‘fairness’ ... ** this is package ‘fairness’ version ‘1.2.2’ ** package ‘fairness’ 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 ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (fairness) * installing *source* package ‘bruceR’ ... ** this is package ‘bruceR’ version ‘2025.8’ ** package ‘bruceR’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data *** moving datasets to lazyload DB ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** 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 (bruceR) * installing *source* package ‘RcppArmadillo’ ... ** this is package ‘RcppArmadillo’ version ‘14.6.3-1’ ** package ‘RcppArmadillo’ successfully unpacked and MD5 sums checked ** using staged installation 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 g++-14 -std=gnu++17 accepts -g... yes checking for g++-14 -std=gnu++17 option to enable C++11 features... none needed checking how to run the C++ preprocessor... g++-14 -std=gnu++17 -E checking whether the compiler supports GNU C++... (cached) yes checking whether g++-14 -std=gnu++17 accepts -g... (cached) yes checking for g++-14 -std=gnu++17 option to enable C++11 features... (cached) none needed checking whether we have a suitable tempdir... /home/hornik/tmp/scratch checking whether R CMD SHLIB can already compile programs using OpenMP... yes checking LAPACK_LIBS... system LAPACK found configure: creating ./config.status config.status: creating inst/include/RcppArmadillo/config/RcppArmadilloConfigGenerated.h config.status: creating src/Makevars ** libs using C++ compiler: ‘g++-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpULcTwo/R.INSTALL39e10e3cbd547/RcppArmadillo/src' g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppArmadillo.cpp -o RcppArmadillo.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fopenmp -fpic -g -O2 -Wall -pedantic -mtune=native -c fastLm.cpp -o fastLm.o g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o RcppArmadillo.so RcppArmadillo.o RcppExports.o fastLm.o -fopenmp -llapack -L/home/hornik/tmp/R/lib -lRblas -lgfortran -lm -lquadmath -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpULcTwo/R.INSTALL39e10e3cbd547/RcppArmadillo/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-RcppArmadillo/00new/RcppArmadillo/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 (RcppArmadillo) begin installing package ‘qtlnet’ begin installing package ‘gRain’ begin installing package ‘dcov’ begin installing package ‘regtools’ * installing *source* package ‘regtools’ ... ** this is package ‘regtools’ version ‘1.7.0’ ** package ‘regtools’ successfully unpacked and MD5 sums checked ** using staged installation ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (regtools) begin installing package ‘toweranNA’ begin installing package ‘partools’ * installing *source* package ‘bnlearn’ ... ** this is package ‘bnlearn’ version ‘5.1’ ** using staged installation ** libs using C compiler: ‘gcc-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmp8NJ2jm/R.INSTALL39e121566f8051/bnlearn/src' gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c arcs/arcs2amat.c -o arcs/arcs2amat.o In file included from /home/hornik/tmp/R/include/R.h:70, from arcs/../include/rcore.h:2, from arcs/arcs2amat.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c arcs/arcs2elist.c -o arcs/arcs2elist.o In file included from /home/hornik/tmp/R/include/R.h:70, from arcs/../include/rcore.h:2, from arcs/arcs2elist.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c arcs/bind.c -o arcs/bind.o In file included from /home/hornik/tmp/R/include/R.h:70, from arcs/../include/rcore.h:2, from arcs/bind.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c arcs/filter.arcs.c -o arcs/filter.arcs.o In file included from /home/hornik/tmp/R/include/R.h:70, from arcs/../include/rcore.h:2, from arcs/filter.arcs.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c arcs/hash.c -o arcs/hash.o In file included from /home/hornik/tmp/R/include/R.h:70, from arcs/../include/rcore.h:2, from arcs/hash.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c arcs/is.row.equal.c -o arcs/is.row.equal.o In file included from /home/hornik/tmp/R/include/R.h:70, from arcs/../include/rcore.h:2, from arcs/is.row.equal.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/bayesian.network.c -o bnlearn/bayesian.network.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/bayesian.network.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/bn.recovery.c -o bnlearn/bn.recovery.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/bn.recovery.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/cache.structure.c -o bnlearn/cache.structure.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/cache.structure.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/cextend.c -o bnlearn/cextend.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/cextend.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/colliders.c -o bnlearn/colliders.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/colliders.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/cpdag.c -o bnlearn/cpdag.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/cpdag.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/fitted.c -o bnlearn/fitted.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/fitted.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/nparams.c -o bnlearn/nparams.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/nparams.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bnlearn/shd.c -o bnlearn/shd.o In file included from /home/hornik/tmp/R/include/R.h:70, from bnlearn/../include/rcore.h:2, from bnlearn/shd.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/allocations.c -o core/allocations.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/allocations.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/contingency.tables.c -o core/contingency.tables.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/contingency.tables.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/correlation.c -o core/correlation.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/correlation.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/covariance.matrix.c -o core/covariance.matrix.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/covariance.matrix.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/data.table.c -o core/data.table.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/data.table.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/math.functions.c -o core/math.functions.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/math.functions.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/moments.c -o core/moments.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/moments.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/sampling.c -o core/sampling.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/sampling.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/sets.c -o core/sets.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/sets.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/sort.c -o core/sort.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/sort.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c core/uppertriangular.c -o core/uppertriangular.o In file included from /home/hornik/tmp/R/include/R.h:70, from core/../include/rcore.h:2, from core/uppertriangular.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c fitted/enums.c -o fitted/enums.o In file included from /home/hornik/tmp/R/include/R.h:70, from fitted/../include/rcore.h:2, from fitted/enums.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c fitted/fitted.c -o fitted/fitted.o In file included from /home/hornik/tmp/R/include/R.h:70, from fitted/../include/rcore.h:2, from fitted/fitted.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c fitted/nparams.c -o fitted/nparams.o In file included from /home/hornik/tmp/R/include/R.h:70, from fitted/../include/rcore.h:2, from fitted/nparams.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c fitted/rinterface/nparams.c -o fitted/rinterface/nparams.o In file included from /home/hornik/tmp/R/include/R.h:70, from fitted/rinterface/../../include/rcore.h:2, from fitted/rinterface/nparams.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c foreign/parse.c -o foreign/parse.o In file included from /home/hornik/tmp/R/include/R.h:70, from foreign/../include/rcore.h:2, from foreign/parse.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c globals.c -o globals.o In file included from /home/hornik/tmp/R/include/R.h:70, from include/rcore.h:2, from globals.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/acyclic.c -o graphs/acyclic.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/acyclic.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/completely.directed.c -o graphs/completely.directed.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/completely.directed.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/connected.components.c -o graphs/connected.components.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/connected.components.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/path.c -o graphs/path.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/path.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/path.matrix.c -o graphs/path.matrix.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/path.matrix.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/pdag2dag.c -o graphs/pdag2dag.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/pdag2dag.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/random/graph.generation.c -o graphs/random/graph.generation.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/random/../../include/rcore.h:2, from graphs/random/graph.generation.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/topological.ordering.c -o graphs/topological.ordering.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/topological.ordering.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/rinterface/connected.components.c -o graphs/rinterface/connected.components.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/rinterface/../../include/rcore.h:2, from graphs/rinterface/connected.components.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/rinterface/path.matrix.c -o graphs/rinterface/path.matrix.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/rinterface/../../include/rcore.h:2, from graphs/rinterface/path.matrix.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/rinterface/sid.c -o graphs/rinterface/sid.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/rinterface/../../include/rcore.h:2, from graphs/rinterface/sid.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graphs/sid.c -o graphs/sid.o In file included from /home/hornik/tmp/R/include/R.h:70, from graphs/../include/rcore.h:2, from graphs/sid.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/likelihood.weighting.c -o inference/likelihood.weighting.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/../include/rcore.h:2, from inference/likelihood.weighting.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/loglikelihood/common.c -o inference/loglikelihood/common.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/loglikelihood/../../include/rcore.h:2, from inference/loglikelihood/common.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/loglikelihood/discrete.c -o inference/loglikelihood/discrete.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/loglikelihood/../../include/rcore.h:2, from inference/loglikelihood/discrete.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/loglikelihood/gaussian.c -o inference/loglikelihood/gaussian.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/loglikelihood/../../include/rcore.h:2, from inference/loglikelihood/gaussian.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/loglikelihood/conditional.gaussian.c -o inference/loglikelihood/conditional.gaussian.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/loglikelihood/../../include/rcore.h:2, from inference/loglikelihood/conditional.gaussian.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/rbn.c -o inference/rbn.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/../include/rcore.h:2, from inference/rbn.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/rinterface/loglikelihood.c -o inference/rinterface/loglikelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/rinterface/../../include/rcore.h:2, from inference/rinterface/loglikelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/rinterface/cpdist.c -o inference/rinterface/cpdist.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/rinterface/../../include/rcore.h:2, from inference/rinterface/cpdist.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/rinterface/rbn.c -o inference/rinterface/rbn.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/rinterface/../../include/rcore.h:2, from inference/rinterface/rbn.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c inference/rinterface/likelihood.weighting.c -o inference/rinterface/likelihood.weighting.o In file included from /home/hornik/tmp/R/include/R.h:70, from inference/rinterface/../../include/rcore.h:2, from inference/rinterface/likelihood.weighting.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c learning/averaging/averaging.c -o learning/averaging/averaging.o In file included from /home/hornik/tmp/R/include/R.h:70, from learning/averaging/../../include/rcore.h:2, from learning/averaging/averaging.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c learning/averaging/bootstrap.c -o learning/averaging/bootstrap.o In file included from /home/hornik/tmp/R/include/R.h:70, from learning/averaging/../../include/rcore.h:2, from learning/averaging/bootstrap.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c learning/local/mi.matrix.c -o learning/local/mi.matrix.o In file included from /home/hornik/tmp/R/include/R.h:70, from learning/local/../../include/rcore.h:2, from learning/local/mi.matrix.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c learning/score/hc.cache.lookup.c -o learning/score/hc.cache.lookup.o In file included from /home/hornik/tmp/R/include/R.h:70, from learning/score/../../include/rcore.h:2, from learning/score/hc.cache.lookup.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c learning/score/score.delta.c -o learning/score/score.delta.o In file included from /home/hornik/tmp/R/include/R.h:70, from learning/score/../../include/rcore.h:2, from learning/score/score.delta.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c learning/score/tabu.c -o learning/score/tabu.o In file included from /home/hornik/tmp/R/include/R.h:70, from learning/score/../../include/rcore.h:2, from learning/score/tabu.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c math/conditional.least.squares.c -o math/conditional.least.squares.o In file included from /home/hornik/tmp/R/include/R.h:70, from math/../include/rcore.h:2, from math/conditional.least.squares.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c math/least.squares.c -o math/least.squares.o In file included from /home/hornik/tmp/R/include/R.h:70, from math/../include/rcore.h:2, from math/least.squares.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c math/linear.algebra.c -o math/linear.algebra.o In file included from /home/hornik/tmp/R/include/R.h:70, from math/../include/rcore.h:2, from math/linear.algebra.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c minimal/common.c -o minimal/common.o In file included from /home/hornik/tmp/R/include/R.h:70, from minimal/../include/rcore.h:2, from minimal/common.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c minimal/data.frame.c -o minimal/data.frame.o In file included from /home/hornik/tmp/R/include/R.h:70, from minimal/../include/rcore.h:2, from minimal/data.frame.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c minimal/strings.c -o minimal/strings.o In file included from /home/hornik/tmp/R/include/R.h:70, from minimal/../include/rcore.h:2, from minimal/strings.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c minimal/table.c -o minimal/table.o In file included from /home/hornik/tmp/R/include/R.h:70, from minimal/../include/rcore.h:2, from minimal/table.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c minimal/tiers.c -o minimal/tiers.o In file included from /home/hornik/tmp/R/include/R.h:70, from minimal/../include/rcore.h:2, from minimal/tiers.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c minimal/unique.c -o minimal/unique.o In file included from /home/hornik/tmp/R/include/R.h:70, from minimal/../include/rcore.h:2, from minimal/unique.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c parameters/discrete/classic.discrete.c -o parameters/discrete/classic.discrete.o In file included from /home/hornik/tmp/R/include/R.h:70, from parameters/discrete/../../include/rcore.h:2, from parameters/discrete/classic.discrete.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c parameters/discrete/hierarchical.dirichlet.c -o parameters/discrete/hierarchical.dirichlet.o In file included from /home/hornik/tmp/R/include/R.h:70, from parameters/discrete/../../include/rcore.h:2, from parameters/discrete/hierarchical.dirichlet.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c parameters/rinterface/classic.discrete.c -o parameters/rinterface/classic.discrete.o In file included from /home/hornik/tmp/R/include/R.h:70, from parameters/rinterface/../../include/rcore.h:2, from parameters/rinterface/classic.discrete.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c parameters/rinterface/hierarchical.dirichlet.c -o parameters/rinterface/hierarchical.dirichlet.o In file included from /home/hornik/tmp/R/include/R.h:70, from parameters/rinterface/../../include/rcore.h:2, from parameters/rinterface/hierarchical.dirichlet.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c parameters/rinterface/mixture.ordinary.least.squares.c -o parameters/rinterface/mixture.ordinary.least.squares.o In file included from /home/hornik/tmp/R/include/R.h:70, from parameters/rinterface/../../include/rcore.h:2, from parameters/rinterface/mixture.ordinary.least.squares.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c parameters/rinterface/ordinary.least.squares.c -o parameters/rinterface/ordinary.least.squares.o In file included from /home/hornik/tmp/R/include/R.h:70, from parameters/rinterface/../../include/rcore.h:2, from parameters/rinterface/ordinary.least.squares.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c predict/map.lw.c -o predict/map.lw.o In file included from /home/hornik/tmp/R/include/R.h:70, from predict/../include/rcore.h:2, from predict/map.lw.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c predict/predict.c -o predict/predict.o In file included from /home/hornik/tmp/R/include/R.h:70, from predict/../include/rcore.h:2, from predict/predict.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c preprocessing/dedup.c -o preprocessing/dedup.o In file included from /home/hornik/tmp/R/include/R.h:70, from preprocessing/../include/rcore.h:2, from preprocessing/dedup.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c preprocessing/discretize.c -o preprocessing/discretize.o In file included from /home/hornik/tmp/R/include/R.h:70, from preprocessing/../include/rcore.h:2, from preprocessing/discretize.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c preprocessing/enums.c -o preprocessing/enums.o In file included from /home/hornik/tmp/R/include/R.h:70, from preprocessing/../include/rcore.h:2, from preprocessing/enums.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c preprocessing/rinterface/discretize.c -o preprocessing/rinterface/discretize.o In file included from /home/hornik/tmp/R/include/R.h:70, from preprocessing/rinterface/../../include/rcore.h:2, from preprocessing/rinterface/discretize.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c sanitization/cg.assumptions.c -o sanitization/cg.assumptions.o In file included from /home/hornik/tmp/R/include/R.h:70, from sanitization/../include/rcore.h:2, from sanitization/cg.assumptions.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c sanitization/covariance.c -o sanitization/covariance.o In file included from /home/hornik/tmp/R/include/R.h:70, from sanitization/../include/rcore.h:2, from sanitization/covariance.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c sanitization/data.c -o sanitization/data.o In file included from /home/hornik/tmp/R/include/R.h:70, from sanitization/../include/rcore.h:2, from sanitization/data.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/alpha.star.c -o scores/alpha.star.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/alpha.star.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/cg.loglikelihood.c -o scores/cg.loglikelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/cg.loglikelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/cg.predictive.loglikelihood.c -o scores/cg.predictive.loglikelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/cg.predictive.loglikelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/cg.nal.c -o scores/cg.nal.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/cg.nal.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/custom.score.c -o scores/custom.score.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/custom.score.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/dirichlet.averaged.posterior.c -o scores/dirichlet.averaged.posterior.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/dirichlet.averaged.posterior.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/dirichlet.posterior.c -o scores/dirichlet.posterior.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/dirichlet.posterior.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/discrete.loglikelihood.c -o scores/discrete.loglikelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/discrete.loglikelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/discrete.nal.c -o scores/discrete.nal.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/discrete.nal.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/discrete.predictive.loglikelihood.c -o scores/discrete.predictive.loglikelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/discrete.predictive.loglikelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/enum.c -o scores/enum.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/enum.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/gaussian.loglikelihood.c -o scores/gaussian.loglikelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/gaussian.loglikelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/gaussian.nal.c -o scores/gaussian.nal.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/gaussian.nal.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/gaussian.predictive.loglikelihood.c -o scores/gaussian.predictive.loglikelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/gaussian.predictive.loglikelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/graph.priors.c -o scores/graph.priors.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/graph.priors.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/nml.regret.c -o scores/nml.regret.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/nml.regret.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/nml.regret.table.c -o scores/nml.regret.table.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/nml.regret.table.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/normalized.maximum.likelihood.c -o scores/normalized.maximum.likelihood.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/normalized.maximum.likelihood.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/per.node.score.c -o scores/per.node.score.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/per.node.score.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c scores/wishart.posterior.c -o scores/wishart.posterior.o In file included from /home/hornik/tmp/R/include/R.h:70, from scores/../include/rcore.h:2, from scores/wishart.posterior.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c test.counter.c -o test.counter.o In file included from /home/hornik/tmp/R/include/R.h:70, from include/rcore.h:2, from test.counter.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/conditional.gaussian/cg.mutual.information.c -o tests/conditional.gaussian/cg.mutual.information.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/conditional.gaussian/../../include/rcore.h:2, from tests/conditional.gaussian/cg.mutual.information.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/discrete/df.adjust.c -o tests/discrete/df.adjust.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/discrete/../../include/rcore.h:2, from tests/discrete/df.adjust.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/discrete/discrete.tests.c -o tests/discrete/discrete.tests.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/discrete/../../include/rcore.h:2, from tests/discrete/discrete.tests.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/discrete/jonckheere.c -o tests/discrete/jonckheere.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/discrete/../../include/rcore.h:2, from tests/discrete/jonckheere.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/discrete/shrinkage.c -o tests/discrete/shrinkage.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/discrete/../../include/rcore.h:2, from tests/discrete/shrinkage.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/enums.c -o tests/enums.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/../include/rcore.h:2, from tests/enums.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/gaussian/df.adjust.c -o tests/gaussian/df.adjust.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/gaussian/../../include/rcore.h:2, from tests/gaussian/df.adjust.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/gaussian/gaussian.tests.c -o tests/gaussian/gaussian.tests.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/gaussian/../../include/rcore.h:2, from tests/gaussian/gaussian.tests.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/gaussian/shrinkage.c -o tests/gaussian/shrinkage.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/gaussian/../../include/rcore.h:2, from tests/gaussian/shrinkage.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/omnibus/custom.test.c -o tests/omnibus/custom.test.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/omnibus/../../include/rcore.h:2, from tests/omnibus/custom.test.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/patterns/allsubs.test.c -o tests/patterns/allsubs.test.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/patterns/../../include/rcore.h:2, from tests/patterns/allsubs.test.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/patterns/ctest.c -o tests/patterns/ctest.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/patterns/../../include/rcore.h:2, from tests/patterns/ctest.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/patterns/roundrobin.test.c -o tests/patterns/roundrobin.test.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/patterns/../../include/rcore.h:2, from tests/patterns/roundrobin.test.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/patterns/utest.c -o tests/patterns/utest.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/patterns/../../include/rcore.h:2, from tests/patterns/utest.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/permutation/discrete.monte.carlo.c -o tests/permutation/discrete.monte.carlo.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/permutation/../../include/rcore.h:2, from tests/permutation/discrete.monte.carlo.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/permutation/gaussian.monte.carlo.c -o tests/permutation/gaussian.monte.carlo.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/permutation/../../include/rcore.h:2, from tests/permutation/gaussian.monte.carlo.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/rinterface/allsubs.test.c -o tests/rinterface/allsubs.test.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/rinterface/../../include/rcore.h:2, from tests/rinterface/allsubs.test.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/rinterface/ctest.c -o tests/rinterface/ctest.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/rinterface/../../include/rcore.h:2, from tests/rinterface/ctest.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/rinterface/htest.c -o tests/rinterface/htest.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/rinterface/../../include/rcore.h:2, from tests/rinterface/htest.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/rinterface/indep.test.c -o tests/rinterface/indep.test.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/rinterface/../../include/rcore.h:2, from tests/rinterface/indep.test.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/rinterface/roundrobin.test.c -o tests/rinterface/roundrobin.test.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/rinterface/../../include/rcore.h:2, from tests/rinterface/roundrobin.test.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tests/rinterface/utest.c -o tests/rinterface/utest.o In file included from /home/hornik/tmp/R/include/R.h:70, from tests/rinterface/../../include/rcore.h:2, from tests/rinterface/utest.c:1: /home/hornik/tmp/R/include/R_ext/Boolean.h:65:16: warning: ISO C does not support specifying ‘enum’ underlying types before C23 [-Wpedantic] 65 | typedef enum :int { FALSE = 0, TRUE } Rboolean; // so NOT NA | ^ gcc-14 -std=gnu17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o bnlearn.so arcs/arcs2amat.o arcs/arcs2elist.o arcs/bind.o arcs/filter.arcs.o arcs/hash.o arcs/is.row.equal.o bnlearn/bayesian.network.o bnlearn/bn.recovery.o bnlearn/cache.structure.o bnlearn/cextend.o bnlearn/colliders.o bnlearn/cpdag.o bnlearn/fitted.o bnlearn/nparams.o bnlearn/shd.o core/allocations.o core/contingency.tables.o core/correlation.o core/covariance.matrix.o core/data.table.o core/math.functions.o core/moments.o core/sampling.o core/sets.o core/sort.o core/uppertriangular.o fitted/enums.o fitted/fitted.o fitted/nparams.o fitted/rinterface/nparams.o foreign/parse.o globals.o graphs/acyclic.o graphs/completely.directed.o graphs/connected.components.o graphs/path.o graphs/path.matrix.o graphs/pdag2dag.o graphs/random/graph.generation.o graphs/topological.ordering.o graphs/rinterface/connected.components.o graphs/rinterface/path.matrix.o graphs/rinterface/sid.o graphs/sid.o inference/likelihood.weighting.o inference/loglikelihood/common.o inference/loglikelihood/discrete.o inference/loglikelihood/gaussian.o inference/loglikelihood/conditional.gaussian.o inference/rbn.o inference/rinterface/loglikelihood.o inference/rinterface/cpdist.o inference/rinterface/rbn.o inference/rinterface/likelihood.weighting.o learning/averaging/averaging.o learning/averaging/bootstrap.o learning/local/mi.matrix.o learning/score/hc.cache.lookup.o learning/score/score.delta.o learning/score/tabu.o math/conditional.least.squares.o math/least.squares.o math/linear.algebra.o minimal/common.o minimal/data.frame.o minimal/strings.o minimal/table.o minimal/tiers.o minimal/unique.o parameters/discrete/classic.discrete.o parameters/discrete/hierarchical.dirichlet.o parameters/rinterface/classic.discrete.o parameters/rinterface/hierarchical.dirichlet.o parameters/rinterface/mixture.ordinary.least.squares.o parameters/rinterface/ordinary.least.squares.o predict/map.lw.o predict/predict.o preprocessing/dedup.o preprocessing/discretize.o preprocessing/enums.o preprocessing/rinterface/discretize.o sanitization/cg.assumptions.o sanitization/covariance.o sanitization/data.o scores/alpha.star.o scores/cg.loglikelihood.o scores/cg.predictive.loglikelihood.o scores/cg.nal.o scores/custom.score.o scores/dirichlet.averaged.posterior.o scores/dirichlet.posterior.o scores/discrete.loglikelihood.o scores/discrete.nal.o scores/discrete.predictive.loglikelihood.o scores/enum.o scores/gaussian.loglikelihood.o scores/gaussian.nal.o scores/gaussian.predictive.loglikelihood.o scores/graph.priors.o scores/nml.regret.o scores/nml.regret.table.o scores/normalized.maximum.likelihood.o scores/per.node.score.o scores/wishart.posterior.o test.counter.o tests/conditional.gaussian/cg.mutual.information.o tests/discrete/df.adjust.o tests/discrete/discrete.tests.o tests/discrete/jonckheere.o tests/discrete/shrinkage.o tests/enums.o tests/gaussian/df.adjust.o tests/gaussian/gaussian.tests.o tests/gaussian/shrinkage.o tests/omnibus/custom.test.o tests/patterns/allsubs.test.o tests/patterns/ctest.o tests/patterns/roundrobin.test.o tests/patterns/utest.o tests/permutation/discrete.monte.carlo.o tests/permutation/gaussian.monte.carlo.o tests/rinterface/allsubs.test.o tests/rinterface/ctest.o tests/rinterface/htest.o tests/rinterface/indep.test.o tests/rinterface/roundrobin.test.o tests/rinterface/utest.o -llapack -L/home/hornik/tmp/R/lib -lRblas -lgfortran -lm -lquadmath -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmp8NJ2jm/R.INSTALL39e121566f8051/bnlearn/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-bnlearn/00new/bnlearn/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** 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 (bnlearn) begin installing package ‘bnviewer’ * installing *source* package ‘qtlnet’ ... ** this is package ‘qtlnet’ version ‘1.5.4’ ** package ‘qtlnet’ 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 ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (qtlnet) * installing *source* package ‘bnviewer’ ... ** this is package ‘bnviewer’ version ‘0.1.6’ ** package ‘bnviewer’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** byte-compile and prepare package for lazy loading ** 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 (bnviewer) * installing *source* package ‘partools’ ... ** this is package ‘partools’ version ‘1.1.6’ ** package ‘partools’ successfully unpacked and MD5 sums checked ** using staged installation ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (partools) * installing *source* package ‘toweranNA’ ... ** this is package ‘toweranNA’ version ‘0.1.0’ ** package ‘toweranNA’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data ** byte-compile and prepare package for lazy loading ** 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 (toweranNA) begin installing package ‘qeML’ * installing *source* package ‘bnclassify’ ... ** this is package ‘bnclassify’ version ‘0.4.8’ ** package ‘bnclassify’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmpakaijn/R.INSTALL39e1153280d07e/bnclassify/src' g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c anb-operate.cpp -o anb-operate.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c basic-misc.cpp -o basic-misc.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c basic-probs.cpp -o basic-probs.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bh.cpp -o bh.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/scoped_ptr.hpp:13, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/adjacency_list.hpp:22, from bh.cpp:4: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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() ) | ^~~~~~~~ In file included from /usr/include/c++/14/memory:78, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/unordered/detail/opt_storage.hpp:11, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/unordered/detail/archive_constructed.hpp:12, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/unordered/detail/serialize_container.hpp:14, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/unordered/unordered_set.hpp:18, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/unordered_set.hpp:17, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/adjacency_list.hpp:20: /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/aux_/na_assert.hpp:23, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/arg.hpp:25, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/placeholders.hpp:24, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_categories.hpp:16, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_traits.hpp:25, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/adjacency_list.hpp:24: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:598, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/adjacency_list.hpp:27: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::filtered_graph > >, boost::property > >, boost::keep_all, remove_names > >, boost::property > >, boost::adjacency_list > >, boost::property > >*, std::__cxx11::basic_string, std::__cxx11::basic_string&, boost::vertex_name_t> > >; F = boost::adjacency_list > >, boost::property > >; Rcpp::List = Rcpp::Vector<19>]’: bh.cpp:198:17: required from here 198 | return graph2R(fg, g); | ~~~~~~~^~~~~~~ bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable] 70 | IndexMap index = get(vertex_index, original_graph); | ^~~~~ bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::filtered_graph > >, boost::property >, remove_edge_names > >, boost::property >, boost::adjacency_list > >, boost::property >*, std::__cxx11::basic_string, std::__cxx11::basic_string&, boost::vertex_name_t>, boost::adjacency_list > >, boost::property > >, boost::keep_all>; F = boost::adjacency_list > >, boost::property >; Rcpp::List = Rcpp::Vector<19>]’: bh.cpp:216:17: required from here 216 | return graph2R(fg, g); | ~~~~~~~^~~~~~~ bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable] 70 | IndexMap index = get(vertex_index, original_graph); | ^~~~~ bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::adjacency_list > >, boost::property >; F = boost::adjacency_list > >, boost::property >; Rcpp::List = Rcpp::Vector<19>]’: bh.cpp:272:17: required from here 272 | return graph2R(krusk, krusk); | ~~~~~~~^~~~~~~~~~~~~~ bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable] 70 | IndexMap index = get(vertex_index, original_graph); | ^~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/assert.hpp:35, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:19: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:31, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:20: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/int.hpp:20, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/if.hpp:19, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_traits.hpp:17: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >, boost::property > >’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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 > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >, boost::property > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ComparableConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::IntegerConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >, boost::property > >’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::adjacency_list > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/connected_components.hpp:15, from bh.cpp:5: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::adjacency_list > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list > >, boost::property > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >, boost::property > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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::property > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::adjacency_list > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::adjacency_list > >, boost::property > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >, boost::property > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >; 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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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 >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:515:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::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]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; 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 >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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 = 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]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c data.cpp -o data.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graph-internal.cpp -o graph-internal.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c infer-test-wrappers.cpp -o infer-test-wrappers.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c infer.cpp -o infer.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c multidim-array.cpp -o multidim-array.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I../inst/include -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c table.cpp -o table.o g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o bnclassify.so RcppExports.o anb-operate.o basic-misc.o basic-probs.o bh.o data.o graph-internal.o infer-test-wrappers.o infer.o multidim-array.o table.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmpakaijn/R.INSTALL39e1153280d07e/bnclassify/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-bnclassify/00new/bnclassify/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (bnclassify) * installing *source* package ‘gRain’ ... ** this is package ‘gRain’ version ‘1.4.5’ ** package ‘gRain’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-14 (Debian 14.2.0-19) 14.2.0’ using C++ compiler: ‘g++-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpR3uZ08/R.INSTALL39e9cd68efb96c/gRain/src' g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:205, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Dense:1, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:28, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigen.h:25, from RcppExports.cpp:4: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:174: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:165: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here 24 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:271: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here 27 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here 98 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here 102 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/SparseCore:37, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Sparse:26, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:29: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ 36 | class SparseCompressedBase | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ 96 | class SparseMatrix | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here 61 | typedef Triplet T; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; | ^~~~~~~~~~~~~~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c init.c -o init.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c propagate.cpp -o propagate.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:205, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Dense:1, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:28, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigen.h:25, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include/gRbase.h:7, from propagate.cpp:6: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:174: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:165: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here 24 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:271: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here 27 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here 98 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here 102 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/SparseCore:37, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Sparse:26, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:29: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ 36 | class SparseCompressedBase | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ 96 | class SparseMatrix | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here 61 | typedef Triplet T; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c toBeRemoved.cpp -o toBeRemoved.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:205, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Dense:1, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:28, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigen.h:25, from toBeRemoved.cpp:8: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:174: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:165: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here 24 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:271: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here 27 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here 98 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here 102 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/SparseCore:37, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Sparse:26, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:29: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ 36 | class SparseCompressedBase | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ 96 | class SparseMatrix | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here 61 | typedef Triplet T; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:336:80: required from ‘struct Eigen::internal::evaluator > >’ 336 | typedef typename DenseCoeffsBase::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:1505:8: required from ‘struct Eigen::internal::evaluator >’ 1505 | struct evaluator > | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 77 | SrcEvaluatorType srcEvaluator(src); | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 132 | assign_sparse_to_sparse(dst.derived(), src.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/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]’ 890 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:917:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:778:26: required from ‘Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>& Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>::operator=(const Eigen::SparseMatrix<_Scalar, _Flags, _StorageIndex>&) [with _Scalar = double; int _Options = 0; _StorageIndex = int]’ 778 | Base::operator=(other); | ~~~~~~~~~~~~~~~^~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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]’ 713 | *this = other.derived(); | ~~~~~~^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenWrap.h:387:24: required from ‘Eigen::SparseMatrix Rcpp::traits::Exporter >::get() [with T = double]’ 387 | return ans; | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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*]’ 89 | return exporter.get(); | ~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/as.h:152:31: required from ‘T Rcpp::as(SEXP) [with T = Eigen::SparseMatrix; SEXP = SEXPREC*]’ 152 | return internal::as(x, typename traits::r_type_traits::r_category()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ toBeRemoved.cpp:18:24: required from here 18 | MSpMat X(as(XX_)); | ~~~~~~~~~~^~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o gRain.so RcppExports.o init.o propagate.o toBeRemoved.o -llapack -L/home/hornik/tmp/R/lib -lRblas -lgfortran -lm -lquadmath -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpR3uZ08/R.INSTALL39e9cd68efb96c/gRain/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-gRain/00new/gRain/libs ** R ** demo ** 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 (gRain) begin installing package ‘gRim’ * installing *source* package ‘qeML’ ... ** this is package ‘qeML’ version ‘1.1’ ** package ‘qeML’ successfully unpacked and MD5 sums checked ** using staged installation ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (qeML) * installing *source* package ‘dcov’ ... ** this is package ‘dcov’ version ‘0.1.1’ ** package ‘dcov’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpxCIRR3/R.INSTALL39e9d23d44311a/dcov/src' g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bit.cpp -o bit.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c centering.cpp -o centering.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c dcov.cpp -o dcov.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c dcov1v1.cpp -o dcov1v1.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c mdcov.cpp -o mdcov.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c pcov.cpp -o pcov.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c pdcov.cpp -o pdcov.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c pdcov1v1.cpp -o pdcov1v1.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c perm_test.cpp -o perm_test.o g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o dcov.so RcppExports.o bit.o centering.o dcov.o dcov1v1.o mdcov.o pcov.o pdcov.o pdcov1v1.o perm_test.o -llapack -L/home/hornik/tmp/R/lib -lRblas -lgfortran -lm -lquadmath -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpxCIRR3/R.INSTALL39e9d23d44311a/dcov/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-dcov/00new/dcov/libs ** R ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** 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 (dcov) * installing *source* package ‘gRim’ ... ** this is package ‘gRim’ version ‘0.3.4’ ** package ‘gRim’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-14 (Debian 14.2.0-19) 14.2.0’ using C++ compiler: ‘g++-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpQlVatM/R.INSTALL39ec5423e5561/gRim/src' g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:205, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Dense:1, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:28, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigen.h:25, from ../inst/include/gRim_RcppExports.h:8, from ../inst/include/gRim.h:13, from RcppExports.cpp:4: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:174: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:165: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here 24 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:271: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here 27 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here 98 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here 102 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/SparseCore:37, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Sparse:26, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:29: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ 36 | class SparseCompressedBase | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ 96 | class SparseMatrix | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here 61 | typedef Triplet T; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; | ^~~~~~~~~~~~~~~~ ../inst/include/gRim_RcppExports.h:16:14: warning: ‘void gRim::{anonymous}::validateSignature(const char*)’ defined but not used [-Wunused-function] 16 | void validateSignature(const char* sig) { | ^~~~~~~~~~~~~~~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c _utils_mat.c -o _utils_mat.o gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c _utils_print.c -o _utils_print.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c fit2way.cpp -o fit2way.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:205, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Dense:1, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:28, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigen.h:25, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include/gRbase.h:7, from fit2way.cpp:3: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes] 49 | template<> struct is_arithmetic<__m128> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes] 50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes] 51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; }; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:174: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’ 298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:165: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here 24 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Core:271: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here 27 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits >’ 22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar; | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits >’ 266 | Alignment = internal::traits::Alignment, | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here 98 | ResAlignment = traits >::Alignment | ^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase, 0>’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase, 1>’ 302 | class DenseCoeffsBase : public DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase, 3>’ 555 | class DenseCoeffsBase | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase >’ 41 | template class DenseBase | ^~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase >’ 48 | template class MatrixBase | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase >’ 98 | class PlainObjectBase : public internal::dense_xpr_base::type | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix’ 178 | class Matrix | ^~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase >’ 46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType; | ^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion’ 273 | class Quaternion : public QuaternionBase > | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here 102 | { | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/SparseCore:37, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/Sparse:26, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/RcppEigenForward.h:29: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase >’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase >’ 36 | class SparseCompressedBase | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix’ 96 | class SparseMatrix | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here 61 | typedef Triplet T; | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/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; | ^~~~~~~~~~~~~~~~ gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c ggmfit.c -o ggmfit.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c grips_arma_utils.cpp -o grips_arma_utils.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c grips_fit_ips.cpp -o grips_fit_ips.o grips_fit_ips.cpp: In function ‘Rcpp::List covips_ggm_(arma::mat&, Rcpp::List&, arma::umat&, int&, arma::mat&, int&, double&, int&, int&, Rcpp::List&)’: grips_fit_ips.cpp:295:16: warning: variable ‘logLp’ set but not used [-Wunused-but-set-variable] 295 | double logL, logLp, conv_check=9999, gap=-1.0, maxabs; | ^~~~~ In file included from grips_fit_ips.cpp:2: grips_fit_ips.cpp: In function ‘Rcpp::List conips_ggm_(arma::mat&, Rcpp::List&, arma::umat&, int&, arma::mat, int&, double&, int&, int&, Rcpp::List&)’: grips_utils.h:85:26: warning: ‘logLp’ may be used uninitialized [-Wmaybe-uninitialized] 85 | conv_check = fabs(logL - logLp) / nparm; \ | ~~~~~^~~~~~~ grips_fit_ips.cpp:168:7: note: in expansion of macro ‘CONV_CHECK_LOGL_DIFF’ 168 | CONV_CHECK_LOGL_DIFF; | ^~~~~~~~~~~~~~~~~~~~ grips_fit_ips.cpp:119:16: note: ‘logLp’ was declared here 119 | double logL, logLp, conv_check=9999, gap=-1.0; | ^~~~~ g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c grips_fit_ncd.cpp -o grips_fit_ncd.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/RcppCommon.h:192, from /home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include/RcppArmadillo/interface/RcppArmadilloForward.h:25, from /home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include/RcppArmadillo.h:29, from grips_fit_ncd.cpp:1: In function ‘SEXPREC* Rcpp::internal::primitive_wrap__impl__cast(const T&, Rcpp::traits::false_type) [with T = double]’, inlined from ‘SEXPREC* Rcpp::internal::primitive_wrap__impl(const T&, Rcpp::traits::r_type_primitive_tag) [with T = double]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/internal/wrap.h:471:46, inlined from ‘SEXPREC* Rcpp::internal::primitive_wrap(const T&) [with T = double]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/internal/wrap.h:495:40, inlined from ‘SEXPREC* Rcpp::internal::wrap_dispatch(const T&, Rcpp::traits::wrap_type_primitive_tag) [with T = double]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/internal/wrap.h:744:34, inlined from ‘SEXPREC* Rcpp::wrap(const T&) [with T = double]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/internal/wrap_end.h:30:38, inlined from ‘static SEXPREC* Rcpp::internal::generic_element_converter::get(const T&) [with T = double; int RTYPE = 19]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/converter.h:80:23, inlined from ‘static void Rcpp::Vector::replace_element__dispatch__isArgument(Rcpp::traits::false_type, iterator, SEXP, R_xlen_t, const U&) [with U = Rcpp::traits::named_object; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:530:13, inlined from ‘static void Rcpp::Vector::replace_element__dispatch(Rcpp::traits::true_type, iterator, SEXP, R_xlen_t, const U&) [with U = Rcpp::traits::named_object; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:523:46, inlined from ‘static void Rcpp::Vector::replace_element(iterator, SEXP, R_xlen_t, const U&) [with U = Rcpp::traits::named_object; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:512:34, inlined from ‘static void Rcpp::Vector::replace_element_impl(iterator&, Rcpp::Shield&, int&, const T&, const TArgs& ...) [with T = Rcpp::traits::named_object; TArgs = {Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object}; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:1169:24, inlined from ‘static void Rcpp::Vector::replace_element_impl(iterator&, Rcpp::Shield&, int&, const T&, const TArgs& ...) [with T = Rcpp::traits::named_object >; TArgs = {Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object}; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:1170:29, inlined from ‘static void Rcpp::Vector::replace_element_impl(iterator&, Rcpp::Shield&, int&, const T&, const TArgs& ...) [with T = Rcpp::traits::named_object >; TArgs = {Rcpp::traits::named_object >, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object}; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:1170:29, inlined from ‘static Rcpp::Vector Rcpp::Vector::create__dispatch(Rcpp::traits::true_type, const T& ...) [with T = {Rcpp::traits::named_object >, Rcpp::traits::named_object >, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object}; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:1146:29, inlined from ‘static Rcpp::Vector Rcpp::Vector::create(const T& ...) [with T = {Rcpp::traits::named_object >, Rcpp::traits::named_object >, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object, Rcpp::traits::named_object}; int RTYPE = 19; StoragePolicy = Rcpp::PreserveStorage]’ at /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/vector/Vector.h:1128:50, inlined from ‘Rcpp::List ncd_ggm_(arma::mat&, Rcpp::List&, arma::umat&, int&, arma::mat, int, double&, int&, int, Rcpp::List&)’ at grips_fit_ncd.cpp:363:33: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/internal/wrap.h:448:41: warning: ‘logL’ may be used uninitialized [-Wmaybe-uninitialized] 448 | r_vector_start(x)[0] = object; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ grips_fit_ncd.cpp: In function ‘Rcpp::List ncd_ggm_(arma::mat&, Rcpp::List&, arma::umat&, int&, arma::mat, int, double&, int&, int, Rcpp::List&)’: grips_fit_ncd.cpp:263:10: note: ‘logL’ was declared here 263 | double logL, gap=-1.0, conv_check, eps2, mno; | ^~~~ grips_fit_ncd.cpp:352:21: warning: ‘itcount’ may be used uninitialized [-Wmaybe-uninitialized] 352 | itcount = itcount / n_vars; | ~~~~~~~~^~~~~~~~ grips_fit_ncd.cpp:264:21: note: ‘itcount’ was declared here 264 | int iter1, iter2, itcount, n_upd=0; | ^~~~~~~ g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c grips_utils.cpp -o grips_utils.o gcc-14 -std=gnu23 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c init.c -o init.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/tmp/CRAN_recheck/Library/RcppArmadillo/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/RcppEigen/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/gRbase/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c parm_conversion.cpp -o parm_conversion.o g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o gRim.so RcppExports.o _utils_mat.o _utils_print.o fit2way.o ggmfit.o grips_arma_utils.o grips_fit_ips.o grips_fit_ncd.o grips_utils.o init.o parm_conversion.o -llapack -L/home/hornik/tmp/R/lib -lRblas -lgfortran -lm -lquadmath -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpQlVatM/R.INSTALL39ec5423e5561/gRim/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-gRim/00new/gRim/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 (gRim) checking bnlearn_5.1.tar.gz ... checking BayesianNetwork_0.3.2.tar.gz ... checking BayesNetBP_1.6.1.tar.gz ... checking bayesvl_1.0.0.tar.gz ... checking bnmonitor_0.2.2.tar.gz ... checking bnpa_0.3.0.tar.gz ... checking bnRep_0.0.5.tar.gz ... checking BNrich_0.1.1.tar.gz ... checking BNSL_0.1.4.tar.gz ... checking bnviewer_0.1.6.tar.gz ... checking cia_1.0.0.tar.gz ... checking criticality_0.9.3.tar.gz ... checking dagHMM_0.1.1.tar.gz ... checking dbnlearn_0.1.0.tar.gz ... checking dbnR_0.7.9.tar.gz ... checking DPI_2025.8.tar.gz ... checking GroupBN_1.2.0.tar.gz ... checking imbalance_1.0.2.1.tar.gz ... checking mDAG_1.2.2.tar.gz ... checking MoTBFs_1.4.2.tar.gz ... checking MRPC_3.1.0.tar.gz ... checking OrdCD_1.1.2.tar.gz ... checking pchc_1.3.tar.gz ... checking r.blip_1.1.tar.gz ... checking rPACI_0.2.2.tar.gz ... checking SELF_0.1.1.tar.gz ... checking StratifiedBalancing_0.3.0.tar.gz ... checking CompareCausalNetworks_0.2.6.2.tar.gz ... checking stagedtrees_2.3.0.tar.gz ... checking gRain_1.4.5.tar.gz ... checking ParallelPC_1.2.tar.gz ... checking OGI_1.0.0.tar.gz ... checking rbmn_0.9-6.tar.gz ... checking dsld_0.2.2.tar.gz ... Depends: Package: bnlearn Depends: R (>= 4.4.0), methods Timings: user system elapsed bnlearn 105.391 10.269 117.889 Results: Check status summary: NOTE OK Source packages 0 1 Reverse depends 6 27 Check results summary: bnlearn ... OK rdepends_BayesianNetwork ... OK rdepends_BayesNetBP ... OK rdepends_bayesvl ... OK rdepends_bnmonitor ... OK rdepends_bnpa ... OK rdepends_bnRep ... OK rdepends_BNrich ... OK rdepends_BNSL ... OK rdepends_bnviewer ... NOTE * checking Rd files ... [0s/0s] NOTE rdepends_cia ... OK rdepends_CompareCausalNetworks ... OK rdepends_criticality ... OK rdepends_dagHMM ... OK rdepends_dbnlearn ... OK rdepends_dbnR ... OK rdepends_DPI ... OK rdepends_dsld ... NOTE * checking DESCRIPTION meta-information ... NOTE rdepends_gRain ... NOTE * checking for unstated dependencies in ‘demo’ ... NOTE rdepends_GroupBN ... OK rdepends_imbalance ... NOTE * checking C++ specification ... NOTE * checking Rd files ... [0s/0s] NOTE rdepends_mDAG ... NOTE * checking C++ specification ... NOTE rdepends_MoTBFs ... OK rdepends_MRPC ... NOTE * checking Rd cross-references ... NOTE rdepends_OGI ... OK rdepends_OrdCD ... OK rdepends_ParallelPC ... OK rdepends_pchc ... OK rdepends_r.blip ... OK rdepends_rbmn ... OK rdepends_rPACI ... OK rdepends_SELF ... OK rdepends_stagedtrees ... OK rdepends_StratifiedBalancing ... OK Check results changes: Package: BayesNetBP Check: CRAN incoming feasibility Old result: NOTE Package: bnpa Check: CRAN incoming feasibility Old result: NOTE Package: BNSL Check: CRAN incoming feasibility Old result: NOTE Package: CompareCausalNetworks Check: CRAN incoming feasibility Old result: NOTE Package: imbalance Check: CRAN incoming feasibility Old result: NOTE Package: mDAG Check: CRAN incoming feasibility Old result: NOTE Package: MRPC Check: CRAN incoming feasibility Old result: NOTE Package: ParallelPC Check: CRAN incoming feasibility Old result: NOTE Package: rbmn Check: CRAN incoming feasibility Old result: NOTE Package: SELF Check: CRAN incoming feasibility Old result: NOTE Package: stagedtrees Check: CRAN incoming feasibility Old result: NOTE Package: StratifiedBalancing Check: CRAN incoming feasibility Old result: NOTE