downloading reverse dependencies ... downloading chemodiv_0.3.1.tar.gz ... ok downloading LDM_6.0.1.tar.gz ... ok downloading mecoturn_0.3.1.tar.gz ... ok downloading MiRKAT_1.2.3.tar.gz ... ok downloading RPANDA_2.4.tar.gz ... ok downloading microeco_1.15.0.tar.gz ... ok installing dependencies ‘castor’, ‘ChemmineR’, ‘fmcsR’, ‘GUniFrac’, ‘hillR’, ‘microeco’, ‘mvMORPH’, ‘PearsonDS’, ‘pvclust’, ‘rgexf’, ‘TESS’, ‘webchem’ begin installing package ‘webchem’ begin installing package ‘ChemmineR’ begin installing package ‘hillR’ begin installing package ‘GUniFrac’ begin installing package ‘castor’ begin installing package ‘microeco’ begin installing package ‘mvMORPH’ begin installing package ‘PearsonDS’ begin installing package ‘pvclust’ begin installing package ‘TESS’ begin installing package ‘rgexf’ * installing *source* package ‘pvclust’ ... ** this is package ‘pvclust’ version ‘2.2-0’ ** package ‘pvclust’ 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 (pvclust) * installing *source* package ‘hillR’ ... ** this is package ‘hillR’ version ‘0.5.2’ ** package ‘hillR’ 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 ** 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 (hillR) * installing *source* package ‘rgexf’ ... ** this is package ‘rgexf’ version ‘0.16.3’ ** package ‘rgexf’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data ** demo ** 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 (rgexf) * installing *source* package ‘webchem’ ... ** this is package ‘webchem’ version ‘1.3.1’ ** package ‘webchem’ 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 (webchem) * installing *source* package ‘PearsonDS’ ... ** this is package ‘PearsonDS’ version ‘1.3.2’ ** package ‘PearsonDS’ successfully unpacked and MD5 sums checked ** using staged installation checking whether x86 FPU control code is needed... yes checking for gcc... gcc-15 checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc-15 accepts -g... yes checking for gcc-15 option to enable C11 features... none needed checking for usable _FPU_SETCW... yes checking for usable fpsetprec... no checking for usable _controlfp... no checking for usable _controlfp_s... no checking whether FPU control word can be manipulated by inline assembler... yes configure: creating ./config.status config.status: creating src/config.h ** libs using C compiler: ‘gcc-15 (Debian 15.2.0-1) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmp6S2tbH/R.INSTALL2316b44eeb45af/PearsonDS/src' gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c Complex.c -o Complex.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c DoubleDouble.c -o DoubleDouble.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c F21.c -o F21.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c F21DD.c -o F21DD.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c F21QD.c -o F21QD.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c QuadDouble.c -o QuadDouble.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c pearson.c -o pearson.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c pearsonIV.c -o pearsonIV.o gcc-15 -shared -L/home/hornik/tmp/R-d-gcc-15/lib -Wl,-O1 -o PearsonDS.so Complex.o DoubleDouble.o F21.o F21DD.o F21QD.o QuadDouble.o pearson.o pearsonIV.o -L/home/hornik/tmp/R-d-gcc-15/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmp6S2tbH/R.INSTALL2316b44eeb45af/PearsonDS/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-PearsonDS/00new/PearsonDS/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 (PearsonDS) * installing *source* package ‘TESS’ ... ** this is package ‘TESS’ version ‘2.1.2’ ** package ‘TESS’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-1) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpRqQnNQ/R.INSTALL2316b0440290e4/TESS/src' g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/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++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/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 mass_extinction_equations.cpp -o mass_extinction_equations.o g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R-d-gcc-15/lib -Wl,-O1 -o TESS.so RcppExports.o mass_extinction_equations.o -L/home/hornik/tmp/R-d-gcc-15/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpRqQnNQ/R.INSTALL2316b0440290e4/TESS/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-TESS/00new/TESS/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 (TESS) * installing *source* package ‘GUniFrac’ ... ** this is package ‘GUniFrac’ version ‘1.9’ ** using staged installation ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-1) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpbXwk74/R.INSTALL2316a42214ab0/GUniFrac/src' g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/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 PairwiseD.cpp -o PairwiseD.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/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++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/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 gmpr.cpp -o gmpr.o g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R-d-gcc-15/lib -Wl,-O1 -o GUniFrac.so PairwiseD.o RcppExports.o gmpr.o -L/home/hornik/tmp/R-d-gcc-15/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpbXwk74/R.INSTALL2316a42214ab0/GUniFrac/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-GUniFrac/00new/GUniFrac/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 (GUniFrac) * installing *source* package ‘mvMORPH’ ... ** this is package ‘mvMORPH’ version ‘1.2.1’ ** package ‘mvMORPH’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-15 (Debian 15.2.0-1) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmp0D0eER/R.INSTALL2316af46c8fea/mvMORPH/src' gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c chol_rpf_row.c -o chol_rpf_row.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c chol_rpf_univ.c -o chol_rpf_univ.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c covar-matrix-simmap.c -o covar-matrix-simmap.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c givens.c -o givens.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c kronecker.c -o kronecker.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c mvMORPH_init.c -o mvMORPH_init.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c mvmorph-covar-mat.c -o mvmorph-covar-mat.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c mvmorph-covar-ou-sparse.c -o mvmorph-covar-ou-sparse.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c mvmorph-covar-ou.c -o mvmorph-covar-ou.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c mvmorph_ou_mat_rpf.c -o mvmorph_ou_mat_rpf.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c pic_loglik_mvmorph.c -o pic_loglik_mvmorph.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c quadprod.c -o quadprod.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c root2tip.c -o root2tip.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c spherical.c -o spherical.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c sqrtMat.c -o sqrtMat.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c time_serie_expectation.c -o time_serie_expectation.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c utils.c -o utils.o gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c weight-matrix-mvmorph.c -o weight-matrix-mvmorph.o gcc-15 -shared -L/home/hornik/tmp/R-d-gcc-15/lib -Wl,-O1 -o mvMORPH.so chol_rpf_row.o chol_rpf_univ.o covar-matrix-simmap.o givens.o kronecker.o mvMORPH_init.o mvmorph-covar-mat.o mvmorph-covar-ou-sparse.o mvmorph-covar-ou.o mvmorph_ou_mat_rpf.o pic_loglik_mvmorph.o quadprod.o root2tip.o spherical.o sqrtMat.o time_serie_expectation.o utils.o weight-matrix-mvmorph.o -llapack -L/home/hornik/tmp/R-d-gcc-15/lib -lRblas -lgfortran -lm -lquadmath -L/home/hornik/tmp/R-d-gcc-15/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmp0D0eER/R.INSTALL2316af46c8fea/mvMORPH/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-mvMORPH/00new/mvMORPH/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 (mvMORPH) * installing *source* package ‘ChemmineR’ ... ** this is package ‘ChemmineR’ version ‘3.60.0’ ** using staged installation ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-1) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmph6gLfV/R.INSTALL2316a51a81bc8d/ChemmineR/src' g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c DisjointSets.cpp -o DisjointSets.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c cluster.cc -o cluster.o cluster.cc: In function ‘int nbr_intersect(std::vector&, std::vector&)’: cluster.cc:118:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 118 | while (i < nbrs1.size() and j < nbrs2.size()) { | ~~^~~~~~~~~~~~~~ cluster.cc:118:39: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 118 | while (i < nbrs1.size() and j < nbrs2.size()) { | ~~^~~~~~~~~~~~~~ cluster.cc: In function ‘int contains(int, std::vector&)’: cluster.cc:131:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 131 | for(int i=0; i < list.size(); i++) | ~~^~~~~~~~~~~~~ cluster.cc: In function ‘DisjointSets cluster(int, int, int, int)’: cluster.cc:267:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 267 | for (int j = 0; j < nbr_list[i].size(); j ++) { | ~~^~~~~~~~~~~~~~~~~~~~ cluster.cc: In function ‘void loadNNMatrix(int, int, int, SEXP)’: cluster.cc:284:28: warning: comparison of integer expressions of different signedness: ‘unsigned int’ and ‘int’ [-Wsign-compare] 284 | for(unsigned i=0; i::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare] 298 | if(nbrs.size() < minNbrs) // will end up a singleton | ~~~~~~~~~~~~^~~~~~~~~ cluster.cc: In function ‘void loadNNList(int, int, SEXP)’: cluster.cc:314:28: warning: comparison of integer expressions of different signedness: ‘unsigned int’ and ‘int’ [-Wsign-compare] 314 | for(unsigned i=0; i::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare] 332 | if(nbrs.size() < minNbrs) // will end up a singleton | ~~~~~~~~~~~~^~~~~~~~~ cluster.cc: In function ‘SEXPREC* jarvis_patrick(SEXP, SEXP, SEXP, SEXP, SEXP)’: cluster.cc:390:28: warning: comparison of integer expressions of different signedness: ‘unsigned int’ and ‘int’ [-Wsign-compare] 390 | for(unsigned i=0; i::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/bind/mem_fn.hpp:23, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mem_fn.hpp:22, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/function/function_template.hpp:16, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/function.hpp:16, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/find_iterator.hpp:24, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:27, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:16, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string.hpp:23: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from /usr/include/c++/15/memory:80, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/function/function_base.hpp:23, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/function/function_template.hpp:14: /usr/include/c++/15/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/concept/assert.hpp:35, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:20, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:19, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/size_type.hpp:20, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/size.hpp:21, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/functions.hpp:20, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/iterator_range_core.hpp:38: /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::algorithm::FinderConcept >, const char*>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:81:13: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/algorithm/string/iter_find.hpp:26: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/concept.hpp:40:18: note: in a call to non-static member function ‘void boost::algorithm::FinderConcept::constraints() [with FinderT = boost::algorithm::detail::token_finderF >; IteratorT = const char*]’ 40 | 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: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/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept’ 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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: /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::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/iterator/iterator_concepts.hpp:114:7: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_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/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::IncrementableIteratorConcept]’ 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/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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: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/range/concepts.hpp:152:13: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 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::range_detail::SinglePassIteratorConcept]’ 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/range/concepts.hpp:278:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_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/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 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::range_detail::SinglePassIteratorConcept]’ 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/range/concepts.hpp:278:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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::range_detail::SinglePassIteratorConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ 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::SinglePassRangeConcept >]’ 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/range/algorithm/equal.hpp:174:13: [ 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/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = const char*]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /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/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ 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::SinglePassRangeConcept >]’ 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/range/algorithm/equal.hpp:174:13: [ 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/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::SinglePassRangeConcept >]’ 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::SinglePassRangeConcept >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = boost::iterator_range; SinglePassRange2 = boost::iterator_range]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/iterator_range_core.hpp:644:32: required from ‘bool boost::operator==(const iterator_range&, const iterator_range&) [with Iterator1T = const char*; Iterator2T = const char*]’ 644 | return boost::equal( l, r ); | ~~~~~~~~~~~~^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/find_iterator.hpp:359:32: required from ‘bool boost::algorithm::split_iterator::equal(const boost::algorithm::split_iterator&) const [with IteratorT = const char*]’ 359 | m_Match==Other.m_Match && | ~~~~~~~^~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:649:26: required from ‘static bool boost::iterators::iterator_core_access::equal(const Facade1&, const Facade2&, mpl_::true_) [with Facade1 = boost::algorithm::split_iterator; Facade2 = boost::algorithm::split_iterator; mpl_::true_ = mpl_::bool_]’ 649 | return f1.equal(f2); | ~~~~~~~~^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:981:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator==(const iterator_facade&, const iterator_facade&) [with Derived1 = boost::algorithm::split_iterator; V1 = const boost::iterator_range; TC1 = forward_traversal_tag; Reference1 = const boost::iterator_range&; Difference1 = long int; Derived2 = boost::algorithm::split_iterator; V2 = const boost::iterator_range; TC2 = forward_traversal_tag; Reference2 = const boost::iterator_range&; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_adaptor.hpp:305:29: [ 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/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const boost::iterator_range]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /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/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept’ 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 = const char*]’ 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::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 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_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::range_detail::IncrementableIteratorConcept]’: /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/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = const char*]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /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/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept]’ 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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 = const char*]’ 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::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 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_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::range_detail::SinglePassIteratorConcept]’: /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/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept’ 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::range_detail::SinglePassIteratorConcept]’ 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 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = const char*]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /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::SinglePassRangeConcept >]’: /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/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ 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::SinglePassRangeConcept >]’ 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/iterator/iterator_facade.hpp:982:3: required from ‘typename boost::iterators::detail::enable_if_interoperable::type>::type boost::iterators::operator!=(const iterator_facade&, const iterator_facade&) [with Derived1 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V1 = std::__cxx11::basic_string; TC1 = forward_traversal_tag; Reference1 = std::__cxx11::basic_string; Difference1 = long int; Derived2 = transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; V2 = std::__cxx11::basic_string; TC2 = forward_traversal_tag; Reference2 = std::__cxx11::basic_string; Difference2 = long int; typename detail::enable_if_interoperable::type>::type = bool; typename boost::mpl::apply2::type = bool]’ 966 | return_prefix iterator_core_access::base_op( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 967 | *static_cast(&lhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 968 | , *static_cast(&rhs) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 969 | , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 970 | ); \ | ~ /usr/include/c++/15/bits/stl_vector.h:1955:21: required from ‘void std::vector<_Tp, _Alloc>::_M_range_initialize(_InputIterator, _InputIterator, std::input_iterator_tag) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >]’ 1955 | for (; __first != __last; ++__first) | ~~~~~~~~^~~~~~~~~ /usr/include/c++/15/bits/stl_vector.h:751:23: required from ‘std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with _InputIterator = boost::iterators::transform_iterator, const char*>, boost::algorithm::split_iterator, boost::use_default, boost::use_default>; = void; _Tp = std::__cxx11::basic_string; _Alloc = std::allocator >; allocator_type = std::allocator >]’ 751 | _M_range_initialize(__first, __last, | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 752 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/iter_find.hpp:186:31: required from ‘SequenceSequenceT& boost::algorithm::iter_split(SequenceSequenceT&, RangeT&&, FinderT) [with SequenceSequenceT = std::vector >; RangeT = const char*&; FinderT = detail::token_finderF >]’ 186 | SequenceSequenceT Tmp(itBegin, itEnd); | ^~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/algorithm/string/split.hpp:158:50: required from ‘SequenceSequenceT& boost::algorithm::split(SequenceSequenceT&, RangeT&&, PredicateT, token_compress_mode_type) [with SequenceSequenceT = std::vector >; RangeT = const char*&; PredicateT = detail::is_any_ofF]’ 158 | return ::boost::algorithm::iter_split( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 159 | Result, | ~~~~~~~ 160 | Input, | ~~~~~~ 161 | ::boost::algorithm::token_finder( Pred, eCompress ) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cstrsplit.cc:14:15: required from here 14 | boost::split(strs, line, boost::is_any_of("\t "),boost::token_compress_on); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const boost::iterator_range]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c desc.cc -o desc.o desc.cc: In function ‘SEXPREC* genAPDescriptor(SEXP)’: desc.cc:249:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 249 | for(int i=0; i < descs.size(); i++) | ~~^~~~~~~~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c fingerprints.cc -o fingerprints.o fingerprints.cc: In function ‘SEXPREC* uniquifyAtomPairs(SEXP)’: fingerprints.cc:138:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 138 | for(int i=0; i < aps.size(); i++) | ~~^~~~~~~~~~~~ fingerprints.cc:145:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 145 | for(int i=0; i < aps.size(); i++){ | ~~^~~~~~~~~~~~ fingerprints.cc:158:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 158 | for(int i=0; i < aps.size(); i++){ | ~~^~~~~~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c formats.cc -o formats.o formats.cc: In function ‘int sdf_iter(std::fstream&, std::string&, int&)’: formats.cc:237:24: warning: ‘char* __builtin_strncpy(char*, const char*, long unsigned int)’ output may be truncated copying 4 bytes from a string of length 100001 [-Wstringop-truncation] 237 | strncpy(buf_4, line, 4); | ^ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c molecule.cc -o molecule.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c r_wrap.cc -o r_wrap.o r_wrap.cc:758:10: warning: ‘R_NO_REMAP’ redefined 758 | # define R_NO_REMAP | ^~~~~~~~~~ : note: this is the location of the previous definition r_wrap.cc:761:10: warning: ‘STRICT_R_HEADERS’ redefined 761 | # define STRICT_R_HEADERS | ^~~~~~~~~~~~~~~~ : note: this is the location of the previous definition g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c script.cc -o script.o In file included from script.cc:2: desc.h:39:13: warning: ‘elements’ defined but not used [-Wunused-variable] 39 | static char elements[112][3] = { | ^~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -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 -DNO_MAIN -DNO_DEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -fpic -g -O2 -Wall -pedantic -mtune=native -c similarity.cc -o similarity.o In file included from similarity.cc:1: desc.h:39:13: warning: ‘elements’ defined but not used [-Wunused-variable] 39 | static char elements[112][3] = { | ^~~~~~~~ g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R-d-gcc-15/lib -Wl,-O1 -o ChemmineR.so DisjointSets.o cluster.o cstrsplit.o desc.o fingerprints.o formats.o molecule.o r_wrap.o script.o similarity.o -L/home/hornik/tmp/R-d-gcc-15/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmph6gLfV/R.INSTALL2316a51a81bc8d/ChemmineR/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-ChemmineR/00new/ChemmineR/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 (ChemmineR) begin installing package ‘fmcsR’ * installing *source* package ‘microeco’ ... ** this is package ‘microeco’ version ‘1.15.0’ ** package ‘microeco’ 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 (microeco) * installing *source* package ‘fmcsR’ ... ** this is package ‘fmcsR’ version ‘1.50.0’ ** 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 we are using the GNU C++ compiler... yes checking whether g++-15 -std=gnu++17 accepts -g... yes checking for gcc... gcc-15 checking whether we are using the GNU C compiler... yes checking whether gcc-15 accepts -g... yes checking for gcc-15 option to accept ISO C89... none needed checking how to run the C preprocessor... gcc-15 -E checking for grep that handles long lines and -e... /usr/bin/grep checking for egrep... /usr/bin/grep -E checking for ANSI C header files... yes checking for sys/types.h... yes checking for sys/stat.h... yes checking for stdlib.h... yes checking for string.h... yes checking for memory.h... yes checking for strings.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for unistd.h... yes checking for stdbool.h that conforms to C99... no checking for _Bool... yes checking for inline... inline checking for size_t... yes checking for alarm... yes configure: creating ./config.status config.status: creating src/Makevars config.status: creating config.h config.status: config.h is unchanged ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-1) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpMB6FWb/R.INSTALL231bf462cf46b/fmcsR/src' g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c MCS.cpp -o MCS.o MCS.cpp: In member function ‘void FMCS::MCS::calculate()’: MCS.cpp:108:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 108 | for (int i = 0; i < atomCountOne; ++i) { | ~~^~~~~~~~~~~~~~ MCS.cpp:116:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 116 | for (int i = 0; i < atomCountTwo; ++i) { | ~~^~~~~~~~~~~~~~ In file included from MCSCompound.h:15, from MCS.h:12, from MCS.cpp:3: MCSList.h: In instantiation of ‘bool FMCS::MCSList::contains(const T&) const [with T = long unsigned int]’: MCS.cpp:381:44: required from here 381 | if (atomListTwoDegrees.contains(atomListOneDegreesPtr[i])) { | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ MCSList.h:143:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 143 | for (int i = 0; i < length; ++i) { | ~~^~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c MCSCompound.cpp -o MCSCompound.o In file included from MCSCompound.cpp:5: MCSRingDetector.h: In constructor ‘FMCS::MCSRingDetector::Ring::Ring(const FMCS::MCSRingDetector::Edge&, const FMCS::MCSCompound*)’: MCSRingDetector.h:86:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 86 | for (int i = 0; i < this->vertexPath.size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ MCSRingDetector.h: In member function ‘int FMCS::MCSRingDetector::Ring::rightVertex(size_t) const’: MCSRingDetector.h:142:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 142 | if (vertexIndex < vertexPath.size()-1) { | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ MCSCompound.cpp: In copy constructor ‘FMCS::MCSCompound::MCSCompound(const FMCS::MCSCompound&)’: MCSCompound.cpp:87:23: warning: ‘void* memcpy(void*, const void*, size_t)’ writing to an object of type ‘struct FMCS::MCSCompound::Atom’ with no trivial copy-assignment; use copy-assignment or copy-initialization instead [-Wclass-memaccess] 87 | memcpy(atoms, other.atoms, sizeof(Atom) * other.atomCount); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from MCSCompound.cpp:4: MCSCompound.h:26:16: note: ‘struct FMCS::MCSCompound::Atom’ declared here 26 | struct Atom { | ^~~~ MCSCompound.cpp: In member function ‘const FMCS::MCSCompound& FMCS::MCSCompound::operator=(const FMCS::MCSCompound&)’: MCSCompound.cpp:123:19: warning: ‘void* memcpy(void*, const void*, size_t)’ writing to an object of type ‘struct FMCS::MCSCompound::Atom’ with no trivial copy-assignment; use copy-assignment or copy-initialization instead [-Wclass-memaccess] 123 | memcpy(atoms, that.atoms, sizeof(Atom) * that.atomCount); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ MCSCompound.h:26:16: note: ‘struct FMCS::MCSCompound::Atom’ declared here 26 | struct Atom { | ^~~~ MCSCompound.cpp: In member function ‘void FMCS::MCSCompound::read(const std::string&)’: MCSCompound.cpp:157:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 157 | for (int i = 0; i < bondCount; ++i) { | ~~^~~~~~~~~~~ MCSCompound.cpp: In member function ‘std::string FMCS::MCSCompound::subgraph(const size_t*, size_t, const std::string&) const’: MCSCompound.cpp:194:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 194 | for (int i = 0; i < indexLength; ++i) { | ~~^~~~~~~~~~~~~ MCSCompound.cpp: In member function ‘const FMCS::MCSCompound::Bond* FMCS::MCSCompound::getBond(size_t, size_t) const’: MCSCompound.cpp:467:26: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 467 | for(int i = 0; i < bondCount; ++i) { | ~~^~~~~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c MCSMap.cpp -o MCSMap.o In file included from MCSMap.h:8, from MCSMap.cpp:3: MCSList.h: In instantiation of ‘bool FMCS::MCSList::contains(const T&) const [with T = long unsigned int]’: MCSMap.cpp:28:32: required from here 28 | return keyList.contains(key); | ~~~~~~~~~~~~~~~~^~~~~ MCSList.h:143:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const size_t’ {aka ‘const long unsigned int’} [-Wsign-compare] 143 | for (int i = 0; i < length; ++i) { | ~~^~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c MCSRingDetector.cpp -o MCSRingDetector.o In file included from MCSRingDetector.cpp:13: MCSRingDetector.h: In constructor ‘FMCS::MCSRingDetector::Ring::Ring(const FMCS::MCSRingDetector::Edge&, const FMCS::MCSCompound*)’: MCSRingDetector.h:86:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 86 | for (int i = 0; i < this->vertexPath.size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ MCSRingDetector.h: In member function ‘int FMCS::MCSRingDetector::Ring::rightVertex(size_t) const’: MCSRingDetector.h:142:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 142 | if (vertexIndex < vertexPath.size()-1) { | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ MCSRingDetector.cpp: In member function ‘void FMCS::MCSRingDetector::sortVertexQueue()’: MCSRingDetector.cpp:93:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 93 | for (int i = 0; i < vertexQueue.size(); ++i) { | ~~^~~~~~~~~~~~~~~~~~~~ MCSRingDetector.cpp:94:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 94 | for (int j = 0; j < queueSize-1-i; ++j ) { | ~~^~~~~~~~~~~~~~~ MCSRingDetector.cpp: In member function ‘void FMCS::MCSRingDetector::convert()’: MCSRingDetector.cpp:149:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 149 | for (int j = 0; j < degree; ++j) { | ~~^~~~~~~~ MCSRingDetector.cpp: In member function ‘void FMCS::MCSRingDetector::detect()’: MCSRingDetector.cpp:175:13: warning: unused variable ‘aromaticCount’ [-Wunused-variable] 175 | int aromaticCount = 0; | ^~~~~~~~~~~~~ MCSRingDetector.cpp: In member function ‘bool FMCS::MCSRingDetector::Ring::isSp2Hybridized(size_t, int, bool&) const’: MCSRingDetector.cpp:194:19: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 194 | if (level > vertexPath.size()) { | ~~~~~~^~~~~~~~~~~~~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c fmcs_R_wrap.cpp -o fmcs_R_wrap.o fmcs_R_wrap.cpp: In function ‘void fmcs_R_wrap(const char**, const char**, int*, int*, int*, int*, int*, int*, int*, const char**, const char**, const char**, const char**, const char**)’: fmcs_R_wrap.cpp:74:45: warning: ‘matchType’ may be used uninitialized [-Wmaybe-uninitialized] 74 | matchType, runningMode, *timeout); | ^ fmcs_R_wrap.cpp:42:24: note: ‘matchType’ was declared here 42 | MCS::MatchType matchType; | ^~~~~~~~~ fmcs_R_wrap.cpp:74:45: warning: ‘runningMode’ may be used uninitialized [-Wmaybe-uninitialized] 74 | matchType, runningMode, *timeout); | ^ fmcs_R_wrap.cpp:52:26: note: ‘runningMode’ was declared here 52 | MCS::RunningMode runningMode; | ^~~~~~~~~~~ g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/include" -DNDEBUG -DSTRICT_R_HEADERS -DR_NO_REMAP -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c util.cpp -o util.o util.cpp: In function ‘std::string getUpper(const std::string&)’: util.cpp:11:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 11 | for (int i = 0; i < upper.length(); ++i) { | ~~^~~~~~~~~~~~~~~~ g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R-d-gcc-15/lib -Wl,-O1 -o fmcsR.so MCS.o MCSCompound.o MCSMap.o MCSRingDetector.o fmcs_R_wrap.o util.o -L/home/hornik/tmp/R-d-gcc-15/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpMB6FWb/R.INSTALL231bf462cf46b/fmcsR/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-fmcsR/00new/fmcsR/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 (fmcsR) * installing *source* package ‘castor’ ... ** this is package ‘castor’ version ‘1.8.4’ ** package ‘castor’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-15 (Debian 15.2.0-1) 15.2.0’ using C++ compiler: ‘g++-15 (Debian 15.2.0-1) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpWUCfBN/R.INSTALL2316b25212d5fa/castor/src' g++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/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++-15 -std=gnu++17 -I"/home/hornik/tmp/R-d-gcc-15/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 STMathExpression.cpp -o STMathExpression.o STMathExpression.cpp:10: warning: ignoring ‘#pragma mark ’ [-Wunknown-pragmas] 10 | #pragma mark - STMathExpression.cpp:11: warning: ignoring ‘#pragma mark String’ [-Wunknown-pragmas] 11 | #pragma mark String manipulations STMathExpression.cpp:12: warning: ignoring ‘#pragma mark ’ [-Wunknown-pragmas] 12 | #pragma mark STMathExpression.cpp:65: warning: ignoring ‘#pragma mark ’ [-Wunknown-pragmas] 65 | #pragma mark - STMathExpression.cpp:66: warning: ignoring ‘#pragma mark MathExpression’ [-Wunknown-pragmas] 66 | #pragma mark MathExpression STMathExpression.cpp:67: warning: ignoring ‘#pragma mark ’ [-Wunknown-pragmas] 67 | #pragma mark STMathExpression.cpp: In static member function ‘static long int MathExpression::splitBinaryOperatorInverseOrder(const std::string&, long int, long int, const std::vector&)’: STMathExpression.cpp:256:42: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘const std::__cxx11::basic_string::size_type’ {aka ‘const long unsigned int’} [-Wsign-compare] 256 | else if(j==string::npos){ if(!STMath_isReal(expression.substr(0,i-1))) return getLeftMostOfPlusMinusOperatorChain(expression,start,i); } | ~^~~~~~~~~~~~~~ STMathExpression.cpp: In member function ‘std::string MathExpression::parseBlock(const std::string&, long int, long int, const std::vector&, const std::map, long int>&, const std::map, long int>&, long int, bool)’: STMathExpression.cpp:313:105: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::__cxx11::basic_string::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 313 | if(isWhiteSpace(expression,start,end)) return "Missing "+(start==0 ? "leading expression" : (end==expression.size()-1 ? "trailing expression" : "expression between '"+expression.substr(0,start)+"' and '"+expression.substr(end+1)+"'")); | ~~~^~~~~~~~~~~~~~~~~~~~~ STMathExpression.cpp:359:37: warning: comparison of integer expressions of different signedness: ‘const long int’ and ‘const std::__cxx11::basic_string::size_type’ {aka ‘const long unsigned int’} [-Wsign-compare] 359 | if((rightMostBracket==string::npos) || (rightMostBracket&)’: STMathExpression.cpp:463:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::__cxx11::basic_string::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 463 | for(long i=0; i&)’: STMathExpression.cpp:500:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::__cxx11::basic_string::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 500 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 953 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 957 | for(long i=0; i&) const’: STMathExpression.cpp:981:34: warning: comparison of integer expressions of different signedness: ‘const __gnu_cxx::__alloc_traits, long int>::value_type’ {aka ‘const long int’} and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 981 | if(variableIDs[i]>=x.size()){ variableValues[i]=0; } STMathExpression.cpp: In member function ‘double MathExpression::operator()(const std::vector&, long int, ...) const’: STMathExpression.cpp:1044:34: warning: comparison of integer expressions of different signedness: ‘const __gnu_cxx::__alloc_traits, long int>::value_type’ {aka ‘const long int’} and ‘long unsigned int’ [-Wsign-compare] 1044 | if(variableIDs[i]>=x.size()+numberOfAdditionalVariables){ variableValues[i]=0; } STMathExpression.cpp:1045:39: warning: comparison of integer expressions of different signedness: ‘const __gnu_cxx::__alloc_traits, long int>::value_type’ {aka ‘const long int’} and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1045 | else if(variableIDs[i] >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1195 | for(long i=0; i >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1202 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1258 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1269 | for(long n=0; n&)’: STMathExpression.cpp:1378:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1378 | for(long i=0; i&) const [with TYPE = long int; std::ostream = std::basic_ostream]’: STMathExpression.cpp:961:14: required from here 961 | printTuple(stream, stackArguments[i]); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ STMathExpression.cpp:1227:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1227 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 251 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 343 | for(long i=0; i >&)’: phylogenetics_cpp_routines.cpp:366:46: warning: comparison of integer expressions of different signedness: ‘std::vector >::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 366 | while((max_Nparts<0) || (parts.size()::size_type’ {aka ‘const long unsigned int’} [-Wsign-compare] 368 | if(pos==string::npos) break; | ~~~^~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:372:43: warning: comparison of integer expressions of different signedness: ‘std::vector >::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 372 | if((max_Nparts<0) || (parts.size()&, long int)’: phylogenetics_cpp_routines.cpp:469:28: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 469 | for(long n=start; n&)’: phylogenetics_cpp_routines.cpp:716:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 716 | for(long i=0; i&)’: phylogenetics_cpp_routines.cpp:731:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 731 | for(long i=0; i&)’: phylogenetics_cpp_routines.cpp:749:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 749 | for(long i=0; i&)’: phylogenetics_cpp_routines.cpp:756:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 756 | for(long i=0; i&)’: phylogenetics_cpp_routines.cpp:785:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 785 | for(long i=0; i&)’: phylogenetics_cpp_routines.cpp:816:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 816 | for(long i=0; i&, double)’: phylogenetics_cpp_routines.cpp:821:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 821 | for(long i=0; i&, double)’: phylogenetics_cpp_routines.cpp:828:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 828 | for(long i=0; i&)’: phylogenetics_cpp_routines.cpp:838:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 838 | for(long i=0; i&)’: phylogenetics_cpp_routines.cpp:891:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 891 | for(long i=0; i >&, const std::vector >&)’: phylogenetics_cpp_routines.cpp:911:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘const long unsigned int’ [-Wsign-compare] 911 | for(long level=0; level, long int>::value_type’ {aka ‘long int’} and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 957 | if(pool2list[pool_index]==list2pool.size()-1){ phylogenetics_cpp_routines.cpp: In function ‘long int get_nearest_index(const std::vector&, long int)’: phylogenetics_cpp_routines.cpp:985:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 985 | for(long i=0; i<(haystack.size()-1); ++i){ | ~^~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::List dense_binary_matrix_row2column_major_CPP(long int, long int, const Rcpp::List&, bool)’: phylogenetics_cpp_routines.cpp:1006:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1006 | for(long i=0; i >&, const lvector&, const dvector&, double, long int)’: phylogenetics_cpp_routines.cpp:1608:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1608 | for(long i=0; i&, const std::vector&, long int, const std::vector&, const std::string&, long int)’: phylogenetics_cpp_routines.cpp:2829:30: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 2829 | for(long t=0, g=-1; t&, double, const std::vector&, long int, const std::vector&)’: phylogenetics_cpp_routines.cpp:3269:29: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3269 | for(long t=0, g=0; t&, const std::vector&, long int, const std::vector&)’: phylogenetics_cpp_routines.cpp:3296:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3296 | for(long t=0, g=0, p; t >&, const std::vector >&, const std::vector >&, double)’: phylogenetics_cpp_routines.cpp:5844:40: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 5844 | for(long r=0; r&, const double&, const std::vector&, const long int&, std::vector&, std::vector&, std::vector&)’: phylogenetics_cpp_routines.cpp:5924:19: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 5924 | for(k=0; k::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 5956 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 8869 | for(long ng=0, og=0; ng::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 8906 | for(long ng=0, og=0; ng&, std::vector, bool, bool)’: phylogenetics_cpp_routines.cpp:9950:56: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 9950 | for(long k=0; k::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 9976 | for(long k=0; k::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 10938 | for(long t=0; t&, const std::vector&, std::vector&)’: phylogenetics_cpp_routines.cpp:12666:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 12666 | for(long q=0; q&, const std::vector&, const tree_context&, dvector&)’: phylogenetics_cpp_routines.cpp:12788:31: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 12788 | for(long q=0, clade; q&, const std::vector&, const std::vector&, bool, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:12894:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 12894 | for(long t=0; t::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 12925 | for(long q=0; q&, const std::vector&, const std::vector&, bool, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:13013:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13013 | for(long t=0; t::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13044 | for(long q=1; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13072 | for(long q=0; q&, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:13134:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13134 | for(long t=0; t::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13164 | for(long q=0; q&, const std::vector&, const std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:13256:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13256 | for(long q=0; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13276 | for(long q=0; q&, const std::vector&, const std::vector&, const std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:13387:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13387 | for(long q=0; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13407 | for(long q=0; q&, const std::vector&, long int, double, double, bool, long int, bool)’: phylogenetics_cpp_routines.cpp:13600:31: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13600 | for(long q=0, clade; q&, const std::vector&, const std::vector&, long int)’: phylogenetics_cpp_routines.cpp:13701:31: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13701 | for(long q=0, clade; q&, const std::vector&, double, double, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:13858:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13858 | for(long q=0; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13882 | for(long c=0; c::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 13883 | for(long c=0; c&, const std::vector&, std::vector&)’: phylogenetics_cpp_routines.cpp:14028:45: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14028 | for(long q=1, clade, pnode, cnode; q&, const std::vector&)’: phylogenetics_cpp_routines.cpp:14284:31: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14284 | for(long q=0, clade; q&, long int, long int, long int)’: phylogenetics_cpp_routines.cpp:14439:16: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14439 | while(k&, long int)’: phylogenetics_cpp_routines.cpp:14496:28: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14496 | while(queue_pointer::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14513 | for(long c=0, clade; c&, const std::vector&, long int)’: phylogenetics_cpp_routines.cpp:14558:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14558 | for(long q=0; q&, const std::vector&, const std::vector&, bool, bool, bool, bool)’: phylogenetics_cpp_routines.cpp:15117:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 15117 | for(long c=0; c::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 15134 | for(long q=0; q, bool, const std::vector&, bool)’: phylogenetics_cpp_routines.cpp:15958:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 15958 | for(long t=0; t::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 15981 | for(long q=1, cnode, pnode; q, bool, const std::vector&, bool)’: phylogenetics_cpp_routines.cpp:16088:29: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16088 | for(long t=0, tip; t::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16102 | for(long q=1; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16137 | for(long q=1; q&, const std::vector&, double)’: phylogenetics_cpp_routines.cpp:16404:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16404 | for(long q=0; q&, const std::vector&, double, double)’: phylogenetics_cpp_routines.cpp:16514:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16514 | for(long q=0; q&, const std::vector&, const std::vector&, bool, bool)’: phylogenetics_cpp_routines.cpp:16854:38: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16854 | for(long n=0, node; n::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16864 | for(long n=0, e, pnode, child; n::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 16928 | for(long q=0, clade, node, absorbing_ancestor, parent, child, e, edge, inedge; q&, const std::vector&, const std::vector&, const std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:17025:48: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 17025 | for(long s=0, clade, inedge, node, e; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 17048 | for(long q=1, clade, node, inedge, e; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 17082 | for(long q=1, clade, inedge; q&, const std::vector&, std::vector&)’: phylogenetics_cpp_routines.cpp:17418:31: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 17418 | for(long q=0, clade; q&, const std::vector >&, const std::vector >&, const std::string&, const std::string&, bool)’: phylogenetics_cpp_routines.cpp:17877:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 17877 | for(long f=0; f >::size_type’ {aka ‘long unsigned int’} and ‘long int’ [-Wsign-compare] 17878 | if(clade_taxonomies_split[fits[f]].size()==max_precision) precise_fits.push_back(fits[f]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::List tree_from_placements_CPP(long int, long int, long int, std::vector, std::vector, const std::vector&, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:17914:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 17914 | for(long i=0; i&, long int, long int, long int, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:18112:38: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18112 | for(long m=0, Tnode, Rnode; m&, long int, long int, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:18342:60: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18342 | for(long fb=0, fa=-1, f; fb relative_to_absolute_node_ages_CPP(long int, long int, long int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:18398:44: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18398 | for(long q=1, clade, node, pnode; q propagate_min_ages_upstream_CPP(long int, long int, long int, const std::vector&, const std::vector&, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:18422:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18422 | for(long a=0; a propagate_max_ages_downstream_CPP(long int, long int, long int, const std::vector&, const std::vector&, const std::vector&, const std::vector&)’: phylogenetics_cpp_routines.cpp:18451:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18451 | for(long a=0; a::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18456 | for(long q=0, clade, node, pnode; q, const std::vector&)’: phylogenetics_cpp_routines.cpp:18518:39: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18518 | for(long q=1, clade, parent; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18535 | for(long q=0, clade, node; q, const std::vector&, double, bool, double)’: phylogenetics_cpp_routines.cpp:18601:50: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18601 | for(long q=0, clade, node, edge, child; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 18643 | for(long q=1, clade, parent; q&, const std::vector&, const std::vector&, double, bool, bool, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, double, bool, std::vector&, std::vector&, std::vector&, double&, double&, double&, double&, long int&, std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:19258:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 19258 | for(long q=0; q&, const std::vector&, const std::vector&, double, bool, bool, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, double, std::vector&, double&, double&, double&, double&, long int&, std::vector&, std::vector&, std::vector&, std::vector&, std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:19571:40: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 19571 | for(long q=0, dominant_state; q&, const std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:20620:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 20620 | for(long q=0, parent; q&, const std::vector&)’: phylogenetics_cpp_routines.cpp:20691:26: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 20691 | for(long fc=0; fc::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 20697 | for(long fc=0; fc&, const std::vector&, const std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:20825:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 20825 | for(long q=0; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 20844 | for(long q=0; q&, const std::vector&)’: phylogenetics_cpp_routines.cpp:20980:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 20980 | for(long t=0; t&, const std::vector&, const std::vector&, const std::vector&, double, bool, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:21210:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 21210 | for(long q=0; q&, const std::vector&, const std::vector&, const Rcpp::ComplexVector&, const Rcpp::ComplexVector&, const Rcpp::ComplexVector&, const std::vector&, const std::string&, const std::vector&, bool, bool, double, double, long int, bool)’: phylogenetics_cpp_routines.cpp:21572:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 21572 | for(long n=0; n::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 21613 | for(long q=0, new_root; q&, const std::vector&, const std::vector&, double, long int, Rcpp::LogicalVector, std::vector, bool)’: phylogenetics_cpp_routines.cpp:22014:37: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22014 | for(long q=0, node, clade; q&, std::vector, std::vector)’: phylogenetics_cpp_routines.cpp:22070:37: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22070 | for(long q=0, node, clade; q&, const std::vector&, const std::vector&, bool)’: phylogenetics_cpp_routines.cpp:22244:42: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22244 | for(long q=0, new_root; q&, const std::vector&, const std::vector&, bool)’: phylogenetics_cpp_routines.cpp:22505:30: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 22505 | if(node_states.size()>Nnodes) node_states.resize(Nnodes); | ~~~~~~~~~~~~~~~~~~^~~~~~~ phylogenetics_cpp_routines.cpp:22506:39: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 22506 | if(node_standard_errors.size()>Nnodes) node_standard_errors.resize(Nnodes); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ phylogenetics_cpp_routines.cpp:22507:29: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 22507 | if(node_CI95s.size()>Nnodes) node_CI95s.resize(Nnodes); | ~~~~~~~~~~~~~~~~~^~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::NumericVector apply_BM_parsimony_to_missing_clades_CPP(long int, long int, long int, const std::vector&, Rcpp::LogicalVector, std::vector)’: phylogenetics_cpp_routines.cpp:22548:37: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22548 | for(long q=0, node, clade; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22583 | for(long i=0, tip; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22602 | for(long i=0, tip; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22622 | for(long i=0, tip; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22824 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22838 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22930 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22943 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22948 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22968 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 22990 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 23013 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 23037 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 23220 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 23233 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 23250 | for(long s=0; s::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 23272 | for(long s=0; s&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, double, double, double, double, double, double, bool, std::vector >&, std::string&, double&, long int&, MuSSEmodelE&, MuSSEmodelD&, std::vector > >&, std::vector >&)’: phylogenetics_cpp_routines.cpp:23521:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 23521 | for(long a=0; a&, const std::vector&, const std::vector&, std::vector, const std::vector&, double, double, double, double, long int, double, bool)’: phylogenetics_cpp_routines.cpp:24346:40: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 24346 | for(long i=0; i&, const std::vector&, const std::vector&, const std::vector&, bool, bool, long int)’: phylogenetics_cpp_routines.cpp:26602:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 26602 | for(long q=0; q&, const std::vector&, double, double, double, bool, bool, long int)’: phylogenetics_cpp_routines.cpp:26682:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 26682 | for(long q=0; q&, const std::vector&, double, double, double, bool, bool, long int)’: phylogenetics_cpp_routines.cpp:26764:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 26764 | for(long q=0; q&, const std::vector&, const std::vector&, double, bool, bool, long int)’: phylogenetics_cpp_routines.cpp:26835:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 26835 | for(long q=0; q&, const std::vector&, const std::vector&, const std::vector&, bool, bool, long int)’: phylogenetics_cpp_routines.cpp:26915:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 26915 | for(long q=0; q&, const std::vector&, const std::vector&, double, bool, bool, bool, long int)’: phylogenetics_cpp_routines.cpp:27007:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27007 | for(long q=0; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27119 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27122 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} and ‘long int’ [-Wsign-compare] 27128 | if(only_sampled_tips && (sampled_tips.size()::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27165 | for(long new_clade=0; new_clade::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27171 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27174 | for(long i=0; i&, const std::vector&, const std::vector&, bool, bool, long int, bool, bool, bool, bool)’: phylogenetics_cpp_routines.cpp:27259:75: warning: comparison of integer expressions of different signedness: ‘long unsigned int’ and ‘const long int’ [-Wsign-compare] 27259 | while(((max_tips<=0) || ((coalescent ? extant_tips.size() : Ntips)::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 27259 | while(((max_tips<=0) || ((coalescent ? extant_tips.size() : Ntips)&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, long int, const std::vector&, const std::vector&, const std::vector&, bool, bool, double, bool, bool, bool, bool)’: phylogenetics_cpp_routines.cpp:27472:100: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 27472 | while(((max_tips<=0) || (Ntips::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 27472 | while(((max_tips<=0) || (Ntips::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 27472 | while(((max_tips<=0) || (Ntips::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27656 | for(long nc=0; nc::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27663 | for(long nc=0; nc::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 27670 | for(long nc=0; nc&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, bool, bool, bool, bool, bool, bool)’: phylogenetics_cpp_routines.cpp:28979:34: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 28979 | for(long nc=0; nc::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 28985 | for(long nc=0; nc::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 28990 | for(long nc=0; nc&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, long int, bool, long int, bool, bool, bool, bool)’: phylogenetics_cpp_routines.cpp:29658:38: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 29658 | for(long stip=0; stip&, double, EdgeLengthUnit, double, double, long int, std::vector&, long int&, std::vector&, std::vector&, std::vector&, std::vector&, std::vector&)’: phylogenetics_cpp_routines.cpp:29902:44: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘long int’ [-Wsign-compare] 29902 | if(clade2tail_length.size()<=next_clade) clade2tail_length.resize(next_clade+1); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:29904:42: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘long int’ [-Wsign-compare] 29904 | if(clade2tail_time.size()<=next_clade) clade2tail_time.resize(next_clade+1); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:29913:41: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 29913 | for(long orphan=0, clade; orphan&, std::vector&, long int&, std::vector&, std::vector&, std::vector&)’: phylogenetics_cpp_routines.cpp:29966:40: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘long int’ [-Wsign-compare] 29966 | if(clade_heights.size()<=next_clade) clade_heights.resize(next_clade+1); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘bool generate_gene_tree_in_species_tree_MSC(long int, long int, long int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::string&, long int, bool, bool, long int, long int&, long int&, long int&, long int&, std::vector&, std::vector&, std::vector&, std::vector&, std::vector&, std::string&)’: phylogenetics_cpp_routines.cpp:30016:64: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30016 | const bool got_allele_counts = (allele_counts.size()==NStips); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~ phylogenetics_cpp_routines.cpp:30017:67: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30017 | const bool got_population_sizes = (population_sizes.size()==NSclades); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30018:67: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30018 | const bool got_generation_times = (generation_times.size()==NSclades); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30019:65: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30019 | const bool got_mutation_rates = (mutation_rates.size()==NSclades); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30042:31: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 30042 | for(long q=0, clade; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 30059 | for(allele=0; allele::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 30144 | for(long orphan=0; orphan&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::string&, long int, bool, bool, long int, bool, bool, double, double, bool)’: phylogenetics_cpp_routines.cpp:30298:83: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30298 | const bool got_population_sizes = (population_sizes.size()==NSclades); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30299:83: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30299 | const bool got_generation_times = (generation_times.size()==NSclades); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30300:81: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30300 | const bool got_mutation_rates = (mutation_rates.size()==NSclades); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30301:80: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30301 | const bool got_allele_counts = (allele_counts.size()==NStips); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~ phylogenetics_cpp_routines.cpp:30302:84: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30302 | const bool got_HGT_rates = (HGT_rates.size()==NSclades); | ~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30303:84: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30303 | const bool got_duplication_rates = (duplication_rates.size()==NSclades); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30304:85: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 30304 | const bool got_loss_rates = (loss_rates.size()==NSclades); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:30325:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 30325 | for(long q=0; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 30332 | for(long q=0, clade; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 30435 | for(long l=0, locus, new_locus; l::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 30461 | for(long l=0, locus; l&, const std::vector&, double, double, double, double, dvector&, dvector&)’: phylogenetics_cpp_routines.cpp:31273:48: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 31273 | for(long q=0, parent, child, e, edge; q&, double, double, double, double)’: phylogenetics_cpp_routines.cpp:31386:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 31386 | for(long t=1; t::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 31859 | for(long p=0; p&, const std::vector&, const std::vector&, double, long int)’: phylogenetics_cpp_routines.cpp:31901:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 31901 | for(long d=0; d&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, long int, long int, const std::vector&, double, long int)’: phylogenetics_cpp_routines.cpp:31939:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 31939 | for(long d=0; d&)’: phylogenetics_cpp_routines.cpp:32101:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 32101 | for(long p=0; p >::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 32645 | if(parts.size()<=distances_column){ | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:32673:56: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 32673 | if((max_Nedges>=0) && (distances.size()>=max_Nedges)) break; | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘bool char_in_string(char, const std::string&, bool)’: phylogenetics_cpp_routines.cpp:32723:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::__cxx11::basic_string::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 32723 | for(long i=0; i::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 32728 | for(long i=0; i >&, const std::vector >&, long int, long int)’: phylogenetics_cpp_routines.cpp:32808:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 32808 | for(long s=0; s]’: phylogenetics_cpp_routines.cpp:5335:29: required from here 5335 | multiply_array_with_scalar(A,factor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:589:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 589 | for(long i=0; i]’: phylogenetics_cpp_routines.cpp:5530:34: required from here 5530 | epsilon /= get_norm_L2_of_vector(balances) * get_norm_L2_of_inverted_vector(balances); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:4936:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 4936 | for(long i=0; i]’: phylogenetics_cpp_routines.cpp:5530:77: required from here 5530 | epsilon /= get_norm_L2_of_vector(balances) * get_norm_L2_of_inverted_vector(balances); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ phylogenetics_cpp_routines.cpp:4944:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 4944 | for(long i=0; i&) [with TYPE = long int]’: phylogenetics_cpp_routines.cpp:8743:48: required from here 8743 | const long NR = (end_c-start_c+1) + vector_sum(dN); | ~~~~~~~~~~^~~~ phylogenetics_cpp_routines.cpp:701:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 701 | for(long i=0; i maxError) && (impCount&, const std::vector&, long int, long int, double, bool, bool, REAL_TYPE&, REAL_TYPE&, REAL_TYPE&, long int&) [with REAL_TYPE = double]’: phylogenetics_cpp_routines.cpp:9335:40: required from here 9335 | if(fitLeastSquares_affine_real_scalar(X, logY, start, end, Xshift[n], false, false, A[n], rate[n], RSS, count[n])){ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:9197:21: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 9197 | if((x.size()<=end) || (y.size()<=end)) return false; | ~~~~~~~~~^~~~~~ phylogenetics_cpp_routines.cpp:9197:40: warning: comparison of integer expressions of different signedness: ‘std::vector::size_type’ {aka ‘long unsigned int’} and ‘const long int’ [-Wsign-compare] 9197 | if((x.size()<=end) || (y.size()<=end)) return false; | ~~~~~~~~~^~~~~~ phylogenetics_cpp_routines.cpp: In instantiation of ‘std::vector& operator*=(std::vector&, double) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:9769:24: required from here 9769 | Acoeff *= (Ngrid-1.0)/Aend; | ^~~~ phylogenetics_cpp_routines.cpp:3459:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3459 | for(long i=0; i&, std::vector&, std::vector&, std::vector&, bool, const std::string&) [with ARRAY_TYPE = std::vector; std::string = std::__cxx11::basic_string]’: phylogenetics_cpp_routines.cpp:12152:33: required from here 12152 | get_tree_traversal_root_to_tips(Ntips, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ 12153 | Nnodes, | ~~~~~~~ 12154 | Nedges, | ~~~~~~~ 12155 | -1, | ~~~ 12156 | tree_edge, | ~~~~~~~~~~ 12157 | include_tips, | ~~~~~~~~~~~~~ 12158 | false, | ~~~~~~ 12159 | queue, | ~~~~~~ 12160 | node2first_edge, | ~~~~~~~~~~~~~~~~ 12161 | node2last_edge, | ~~~~~~~~~~~~~~~ 12162 | edges, | ~~~~~~ 12163 | false, | ~~~~~~ 12164 | ""); | ~~~ phylogenetics_cpp_routines.cpp:12125:28: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 12125 | while(queue_pointer&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:12798:36: required from here 12798 | const double root_age = vector_max(ages); | ~~~~~~~~~~^~~~~~ phylogenetics_cpp_routines.cpp:779:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 779 | for(long i=0; i&, std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:13867:14: required from here 13867 | qsortIndices(distances_from_root, chronological_clade_order); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:1080:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 1080 | for(long n=0; n&) [with TYPE = long int]’: phylogenetics_cpp_routines.cpp:14166:33: required from here 14166 | const long Nsplits = vector_max(node2child_count); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:779:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 779 | for(long i=0; i&) [with ARRAY_TYPE = std::vector]’: phylogenetics_cpp_routines.cpp:14809:30: required from here 14809 | sort_tree_edges_root_to_tips( Ntips, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ 14810 | Nnodes, | ~~~~~~~ 14811 | Nedges, | ~~~~~~~ 14812 | depth_first_search, | ~~~~~~~~~~~~~~~~~~~ 14813 | root_to_tips, | ~~~~~~~~~~~~~ 14814 | tree_edge, | ~~~~~~~~~~ 14815 | new2old_edge); | ~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:14781:36: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14781 | while(queue_pointer&, std::vector&, std::vector&, long int&, double&) [with ARRAY_INT = std::vector; ARRAY_DOUBLE = std::vector; lvector = std::vector]’: phylogenetics_cpp_routines.cpp:15045:40: required from here 15045 | get_tree_with_collapsed_monofurcations( Ntips, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ 15046 | Nnodes, | ~~~~~~~ 15047 | Nedges, | ~~~~~~~ 15048 | root, | ~~~~~ 15049 | force_keep_root, | ~~~~~~~~~~~~~~~~ 15050 | force_keep_nodes, | ~~~~~~~~~~~~~~~~~ 15051 | tree_edge, | ~~~~~~~~~~ 15052 | edge_length, | ~~~~~~~~~~~~ 15053 | new_tree_edge, | ~~~~~~~~~~~~~~ 15054 | new_edge_length, | ~~~~~~~~~~~~~~~~ 15055 | new2old_node, | ~~~~~~~~~~~~~ 15056 | new_root, | ~~~~~~~~~ 15057 | root_shift); | ~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:14941:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14941 | for(long fn=0, node; fn::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14955 | for(long q=0; q::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 14978 | for(long q=0; q&, std::vector&, std::vector&, long int&, long int&, long int&, long int&, long int&, double&) [with ARRAY_INT = std::vector; ARRAY_DOUBLE = std::vector; lvector = std::vector]’: phylogenetics_cpp_routines.cpp:15657:32: required from here 15657 | get_subtree_with_specific_tips( Ntips, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ 15658 | Nnodes, | ~~~~~~~ 15659 | Nedges, | ~~~~~~~ 15660 | tree_edge, | ~~~~~~~~~~ 15661 | edge_length, | ~~~~~~~~~~~~ 15662 | tips_to_keep, | ~~~~~~~~~~~~~ 15663 | collapse_monofurcations, | ~~~~~~~~~~~~~~~~~~~~~~~~ 15664 | force_keep_root, | ~~~~~~~~~~~~~~~~ 15665 | lvector(), | ~~~~~~~~~~ 15666 | new_tree_edge, | ~~~~~~~~~~~~~~ 15667 | new_edge_length, | ~~~~~~~~~~~~~~~~ 15668 | new2old_clade, | ~~~~~~~~~~~~~~ 15669 | new_root, | ~~~~~~~~~ 15670 | old_stem_edge, | ~~~~~~~~~~~~~~ 15671 | Ntips_kept, | ~~~~~~~~~~~ 15672 | Nnodes_kept, | ~~~~~~~~~~~~ 15673 | Nedges_kept, | ~~~~~~~~~~~~ 15674 | root_shift); | ~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:15515:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 15515 | for(long t=0; t::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 15518 | for(long fn=0; fn::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 15591 | for(long fn=0, new_clade; fn; ARRAY_TYPE_D = std::vector; dvector = std::vector]’: phylogenetics_cpp_routines.cpp:16884:26: required from here 16884 | get_distances_from_root(Ntips, Nnodes, Nedges, tree_edge, edge_length, context, clade_times); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:12746:31: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 12746 | for(long q=0, clade; q&, TYPE2, long int) [with TYPE1 = long int; TYPE2 = long int]’: phylogenetics_cpp_routines.cpp:18344:33: required from here 18344 | fa = find_in_ascending_list(membershipsA[nodeA],f,fa+1); | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:495:28: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 495 | for(long n=start; n operator/(std::vector, double) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:22813:19: required from here 22813 | shape = initial/initial_mean; | ^~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:3541:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3541 | for(long i=0; i operator*(std::vector, double) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:22876:27: required from here 22876 | rateY = YA - currentY*rateS; | ^~~~~ phylogenetics_cpp_routines.cpp:3441:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3441 | for(long i=0; i operator-(std::vector, const std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:22876:27: required from here 22876 | rateY = YA - currentY*rateS; | ^~~~~ phylogenetics_cpp_routines.cpp:3495:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3495 | for(long i=0; i operator+(std::vector, const std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:22985:66: required from here 22985 | candidate_state = previous_state*(1-lambda) + candidate_state*lambda; | ^~~~~~ phylogenetics_cpp_routines.cpp:3468:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3468 | for(long i=0; i&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:23049:22: required from here 23049 | return contains_nan(state); | ~~~~~~~~~~~~^~~~~~~ phylogenetics_cpp_routines.cpp:874:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 874 | for(long i=0; i& operator*=(std::vector&, const std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:23409:32: required from here 23409 | posteriors[node] *= modelD.initial; | ^~~~~~~ phylogenetics_cpp_routines.cpp:3432:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3432 | for(long i=0; i&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:23430:30: required from here 23430 | const double S = vector_sum(posteriors[node]); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:701:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 701 | for(long i=0; i& operator/=(std::vector&, double) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:23431:23: required from here 23431 | posteriors[node] /= S; | ^ phylogenetics_cpp_routines.cpp:3550:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3550 | for(long i=0; i operator*(std::vector, const std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:23439:56: required from here 23439 | loglikelihood += log(vector_sum(posteriors[root_node]*root_prior)); | ^~~~~~~~~~ phylogenetics_cpp_routines.cpp:3423:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3423 | for(long i=0; i&, const std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:23949:38: required from here 23949 | loglikelihood += log(scalar_product(substem_D,substem_prior)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:724:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘const long unsigned int’ [-Wsign-compare] 724 | for(long i=0; i& operator-=(std::vector&, const std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:24348:83: required from here 24348 | dvector coarse_diversification_rates = lambdas; coarse_diversification_rates -= mus; | ^~~ phylogenetics_cpp_routines.cpp:3513:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3513 | for(long i=0; i abs(std::vector) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:24968:48: required from here 24968 | dvector coarse_abs_diversification_rates = abs(coarse_diversification_rates); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:3559:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3559 | for(long i=0; i::getMaxAbs() const [with VALUE_TYPE = double]’: phylogenetics_cpp_routines.cpp:25460:26: required from here 25460 | return lambda.getMaxAbs() + mu.getMaxAbs() + psi.getMaxAbs(); | ~~~~~~~~~~~~~~~~^~ phylogenetics_cpp_routines.cpp:2655:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 2655 | for(long i=0; i::getMaxAbs(double, double) const [with VALUE_TYPE = double]’: phylogenetics_cpp_routines.cpp:25465:26: required from here 25465 | return lambda.getMaxAbs(start_time,end_time) + mu.getMaxAbs(start_time,end_time) + psi.getMaxAbs(start_time,end_time); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:2666:32: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 2666 | for(long i=0; i& operator+=(std::vector&, const TYPE&) [with TYPE = long int]’: phylogenetics_cpp_routines.cpp:25888:20: required from here 25888 | NCSAcrossings += 1l; | ^~ phylogenetics_cpp_routines.cpp:3486:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3486 | for(long i=0; i operator-(std::vector, const TYPE&) [with TYPE = long int]’: phylogenetics_cpp_routines.cpp:27131:52: required from here 27131 | lvector force_keep_nodes = sampled_node_clades - Ntips; | ^~~~~ phylogenetics_cpp_routines.cpp:3504:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3504 | for(long i=0; i&, long int) [with TYPE = long int]’: phylogenetics_cpp_routines.cpp:27592:27: required from here 27592 | remove_item_from_vector(extant_tips, tip); | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:927:17: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 927 | if(index==list.size()-1){ | ~~~~~^~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In instantiation of ‘void simulate_SBM_on_tree(long int, long int, long int, const std::vector&, const std::vector&, double, const DFUNCTOR&, double, double, dvector&, dvector&) [with DFUNCTOR = PiecewisePolynomial; dvector = std::vector]’: phylogenetics_cpp_routines.cpp:31419:22: required from here 31419 | simulate_SBM_on_tree( Ntips, | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ 31420 | Nnodes, | ~~~~~~~ 31421 | Nedges, | ~~~~~~~ 31422 | tree_edge, | ~~~~~~~~~~ 31423 | edge_length, | ~~~~~~~~~~~~ 31424 | radius, | ~~~~~~~ 31425 | diffusivity_integral, | ~~~~~~~~~~~~~~~~~~~~~ 31426 | root_theta, | ~~~~~~~~~~~ 31427 | root_phi, | ~~~~~~~~~ 31428 | clade_theta, | ~~~~~~~~~~~~ 31429 | clade_phi); | ~~~~~~~~~~ phylogenetics_cpp_routines.cpp:31321:48: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 31321 | for(long q=0, parent, child, e, edge; q&, TYPE2) [with TYPE1 = double; TYPE2 = double]’: phylogenetics_cpp_routines.cpp:5409:27: required from ‘long int min_polynomials_for_positive_exponential_of_irreducible_matrix(long int, const ARRAY_TYPE&) [with ARRAY_TYPE = std::vector]’ 5409 | if(find_first_occurrence(sum_of_powers, 0.0)<0) return (p+1); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:21514:94: required from here 21514 | const long min_polynomials = min_polynomials_for_positive_exponential_of_irreducible_matrix(Nstates, transition_matrix); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:477:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 477 | for(long n=0; n operator*(double, std::vector) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:10203:64: required from ‘LinearInterpolationFunctor::LinearInterpolationFunctor(const std::vector&, const std::vector&, bool, const VALUE_TYPE&, const VALUE_TYPE&, bool, double) [with VALUE_TYPE = std::vector]’ 10203 | referenceValues[0] = referenceValues[referenceCount-1] = 0.5*(referenceValues[0] + referenceValues[referenceCount-1]); | ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:23382:141: required from here 23382 | modelD.E = LinearInterpolationFunctor(modelE.ages,modelE.trajectory,false,modelE.trajectory[0],modelE.trajectory.back(),true,0); | ^ phylogenetics_cpp_routines.cpp:3450:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 3450 | for(long i=0; i&, double, const std::vector&, std::vector&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:7467:21: required from ‘bool RungeKutta2(double, double, double, MODEL&, double, double, double, double, long int, double, const PROGRESS_REPORTER&, double, std::string&) [with COORDINATE = std::vector; MODEL = MuSSEmodelE; PROGRESS_REPORTER = ProgressReporter; std::string = std::__cxx11::basic_string]’ 7467 | linear_combination(1.0,currentPoint,current_dt1,k1,point2); // point2 = currentPoint + k1*current_dt1; | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:23484:9: required from here 23483 | bool success = RungeKutta2 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 23484 | (0, // start_time | ^~~~~~~~~~~~~~~~~ 23485 | oldest_age, // end_time | ~~~~~~~~~~~~~~~~~~~~~~~ 23486 | max(0.000001*oldest_age,min(0.2*oldest_age,relative_ODE_step/maxErate)), // default integration time step | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 23487 | modelE, | ~~~~~~~ 23488 | minRecordingTimeStep, | ~~~~~~~~~~~~~~~~~~~~~ 23489 | maxRecordingTimeStep, | ~~~~~~~~~~~~~~~~~~~~~ 23490 | guessNrecordings, | ~~~~~~~~~~~~~~~~~ 23491 | E_value_step, // recordingRelValueStep | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 23492 | 5, // maxTimeStepRefinements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 23493 | 4, // refinement_factor | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 23494 | ProgressReporter(true), | ~~~~~~~~~~~~~~~~~~~~~~~ 23495 | (runtime_out_seconds>0 ? max(runtime_out_seconds*0.01, runtime_out_seconds+start_runtime-get_thread_monotonic_walltime_seconds()) : 0.0), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 23496 | warningMessage); | ~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:440:24: warning: comparison of integer expressions of different signedness: ‘long int’ and ‘std::vector::size_type’ {aka ‘long unsigned int’} [-Wsign-compare] 440 | for(long i=0; i&, const std::vector&)’: phylogenetics_cpp_routines.cpp:1331:25: warning: ‘t1’ may be used uninitialized [-Wmaybe-uninitialized] 1331 | W += (t2-t1) * abs(CDFY-CDFX); | ~~~^~~~ phylogenetics_cpp_routines.cpp:1315:32: note: ‘t1’ was declared here 1315 | double CDFX=0, CDFY=0, t1, t2; | ^~ phylogenetics_cpp_routines.cpp: In function ‘double solve_polynomial_via_bisection(const double*, long int, double, double, double, double, double, double, long int)’: phylogenetics_cpp_routines.cpp:2269:16: warning: ‘c’ may be used uninitialized [-Wmaybe-uninitialized] 2269 | return c; // did not converge, but the last c is the best estimate | ^ phylogenetics_cpp_routines.cpp:2215:36: note: ‘c’ was declared here 2215 | double a = Xmin, b = Xmax, c; | ^ phylogenetics_cpp_routines.cpp: In function ‘double legendre_polynomial(long int, double)’: phylogenetics_cpp_routines.cpp:30983:16: warning: ‘Pn’ may be used uninitialized [-Wmaybe-uninitialized] 30983 | return Pn; | ^~ phylogenetics_cpp_routines.cpp:30977:16: note: ‘Pn’ was declared here 30977 | double Pn; | ^~ phylogenetics_cpp_routines.cpp: In function ‘double solve_piecewise_polynomial_bisection(const dvector&, const dvector&, long int, bool, double, double, double, bool, double, double, long int, long int&, long int&)’: phylogenetics_cpp_routines.cpp:2352:16: warning: ‘c’ may be used uninitialized [-Wmaybe-uninitialized] 2352 | return c; // did not converge, but the last c is the best estimate | ^ phylogenetics_cpp_routines.cpp:2290:36: note: ‘c’ was declared here 2290 | double a = Xmin, b = Xmax, c; | ^ phylogenetics_cpp_routines.cpp: In function ‘double solve_piecewise_polynomial_sum_bisection(const dvector&, const std::vector >&, const lvector&, bool, const dvector&, double, double, double, bool, double, double, long int, long int&, long int&)’: phylogenetics_cpp_routines.cpp:2449:16: warning: ‘c’ may be used uninitialized [-Wmaybe-uninitialized] 2449 | return c; // did not converge, but the last c is the best estimate | ^ phylogenetics_cpp_routines.cpp:2382:36: note: ‘c’ was declared here 2382 | double a = Xmin, b = Xmax, c; | ^ phylogenetics_cpp_routines.cpp: In function ‘bool get_dominant_eigenvalue(long int, const dvector&, long int, double, dvector&, double&)’: phylogenetics_cpp_routines.cpp:6040:37: warning: ‘error’ may be used uninitialized [-Wmaybe-uninitialized] 6040 | return (best_error&, double, const std::vector&, const std::vector&, long int, const std::string&, double, double)’: phylogenetics_cpp_routines.cpp:25402:51: warning: ‘W_degree’ may be used uninitialized [-Wmaybe-uninitialized] 25402 | const double origin_W = polynomial_value(W_degree,&refined_W_coeff[origin_rg*(W_degree+1)],oldest_age-age_offset); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:25330:24: note: ‘W_degree’ was declared here 25330 | long I_degree, W_degree, NRG; | ^~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::List HBD_PDR_loglikelihood_CPP(const std::vector&, double, double, const std::vector&, const std::vector&, long int, const std::string&, double, double, std::vector, long int)’: phylogenetics_cpp_routines.cpp:25229:102: warning: ‘Zdegree’ may be used uninitialized [-Wmaybe-uninitialized] 25229 | branching_Z = polynomial_value(Zdegree, &Zcoeff[d][current_g*(Zdegree+1)], branching_age-age_offset); | ~~~~~~~~^~~ phylogenetics_cpp_routines.cpp:25195:14: note: ‘Zdegree’ was declared here 25195 | long Zdegree, EZdegree, Wdegree; | ^~~~~~~ phylogenetics_cpp_routines.cpp:25230:102: warning: ‘Wdegree’ may be used uninitialized [-Wmaybe-uninitialized] 25230 | branching_W = polynomial_value(Wdegree, &Wcoeff[d][current_g*(Wdegree+1)], branching_age-age_offset); | ~~~~~~~~^~~ phylogenetics_cpp_routines.cpp:25195:33: note: ‘Wdegree’ was declared here 25195 | long Zdegree, EZdegree, Wdegree; | ^~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘bool LUDecomposition(TYPE*, long unsigned int, long unsigned int*, int&) [with TYPE = double]’: phylogenetics_cpp_routines.cpp:4676:39: warning: ‘imax’ may be used uninitialized [-Wmaybe-uninitialized] 4676 | pivoting_indices[j] = imax; | ^~~~ phylogenetics_cpp_routines.cpp:4635:16: note: ‘imax’ was declared here 4635 | long i,imax,j,k; | ^~~~ phylogenetics_cpp_routines.cpp: In member function ‘void TreeSpeciationExtinctionModel::get_coalescent_trajectory(double, double, std::vector&) const’: phylogenetics_cpp_routines.cpp:10927:96: warning: ‘coalescent_diversity_at_resolution_age’ may be used uninitialized [-Wmaybe-uninitialized] 10927 | coalescent[t].Pmissing = coalescent_diversity_at_resolution_age/coalescent[t].diversity; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:10904:59: note: ‘coalescent_diversity_at_resolution_age’ was declared here 10904 | double total_diversity_at_resolution_age, coalescent_diversity_at_resolution_age; | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::List simulate_deterministic_diversity_growth_CPP(double, double, double, double, double, double, double, double, long int, const std::vector&, const std::vector&, const std::vector&, bool, const std::vector&, double, double, double, double, bool, bool, bool, bool, bool, bool, double)’: phylogenetics_cpp_routines.cpp:11148:86: warning: ‘Pmissing_at_resolution_age’ may be used uninitialized [-Wmaybe-uninitialized] 11148 | const double effective_rarefaction = rarefaction * (1-Pmissing_at_resolution_age); | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:11123:24: note: ‘Pmissing_at_resolution_age’ was declared here 11123 | double Pmissing_at_resolution_age, total_diversity_at_resolution_age, coalescent_diversity_at_resolution_age; | ^~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:11156:88: warning: ‘coalescent_diversity_at_resolution_age’ may be used uninitialized [-Wmaybe-uninitialized] 11156 | Pmissing = 1.0 - coalescent_diversity_at_resolution_age/total_diversities[t]; // effective Pmissing, based on coalescent and total diversity after collapsing and rarefaction phylogenetics_cpp_routines.cpp:11123:87: note: ‘coalescent_diversity_at_resolution_age’ was declared here 11123 | double Pmissing_at_resolution_age, total_diversity_at_resolution_age, coalescent_diversity_at_resolution_age; | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::List get_trait_richness_collectors_curve_CPP(long int, long int, long int, long int, long int, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, const std::vector&, long int, const std::string&, bool)’: phylogenetics_cpp_routines.cpp:20191:49: warning: ‘tip’ may be used uninitialized [-Wmaybe-uninitialized] 20191 | tip_included[tip] = true; | ^ phylogenetics_cpp_routines.cpp:20054:14: note: ‘tip’ was declared here 20054 | long tip, clade, count_tips_remaining; | ^~~ phylogenetics_cpp_routines.cpp:20151:76: warning: ‘count_tips_remaining’ may be used uninitialized [-Wmaybe-uninitialized] 20151 | long tip_counter = uniformIntWithin(0,count_tips_remaining-1); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:20054:26: note: ‘count_tips_remaining’ was declared here 20054 | long tip, clade, count_tips_remaining; | ^~~~~~~~~~~~~~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/RcppCommon.h:192, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp.h:27, from phylogenetics_cpp_routines.cpp:39: 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}; 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}; 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}; 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}; 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}; 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}; 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}; 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 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, 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, 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, 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, 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, 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 read_Newick_string_CPP(std::string, bool, bool, bool, bool)’ at phylogenetics_cpp_routines.cpp:19175:39: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include/Rcpp/internal/wrap.h:448:41: warning: ‘root_edge’ may be used uninitialized [-Wmaybe-uninitialized] 448 | r_vector_start(x)[0] = object; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::List read_Newick_string_CPP(std::string, bool, bool, bool, bool)’: phylogenetics_cpp_routines.cpp:19091:29: note: ‘root_edge’ was declared here 19091 | double edge_length, root_edge; | ^~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::List find_edge_splitting_tree_CPP(long int, long int, long int, std::vector, bool, const std::vector&, bool)’: phylogenetics_cpp_routines.cpp:16149:111: warning: ‘best_Ntargets_upstream’ may be used uninitialized [-Wmaybe-uninitialized] 16149 | else if((!descends_from_best_edge[tip]) && (Nnontargets_downstream_per_clade[tip]==1) && targets_should_be_upstream) misplaced_nontargets.push_back(tip); // misplaced upstream non-target | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:16110:30: note: ‘best_Ntargets_upstream’ was declared here 16110 | long best_edge = -1, best_Ntargets_upstream, best_Ntargets_downstream, best_Nmisplaced_targets, best_Nmisplaced_nontargets; | ^~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:16131:42: warning: ‘best_Nmisplaced_targets’ may be used uninitialized [-Wmaybe-uninitialized] 16131 | misplaced_targets.reserve(best_Nmisplaced_targets); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:16110:80: note: ‘best_Nmisplaced_targets’ was declared here 16110 | long best_edge = -1, best_Ntargets_upstream, best_Ntargets_downstream, best_Nmisplaced_targets, best_Nmisplaced_nontargets; | ^~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:16132:45: warning: ‘best_Nmisplaced_nontargets’ may be used uninitialized [-Wmaybe-uninitialized] 16132 | misplaced_nontargets.reserve(best_Nmisplaced_nontargets); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp:16110:105: note: ‘best_Nmisplaced_nontargets’ was declared here 16110 | long best_edge = -1, best_Ntargets_upstream, best_Ntargets_downstream, best_Nmisplaced_targets, best_Nmisplaced_nontargets; | ^~~~~~~~~~~~~~~~~~~~~~~~~~ phylogenetics_cpp_routines.cpp: In function ‘Rcpp::NumericMatrix get_distance_matrix_between_clades_CPP(long int, long int, long int, const std::vector&, const std::vector&, const std::vector&, bool, const std::string&)’: phylogenetics_cpp_routines.cpp:13316:155: warning: ‘mrca’ may be used uninitialized [-Wmaybe-uninitialized] 13316 | distances(i,j) = distance_from_root_per_clade[cladeA] + distance_from_root_per_clade[cladeB] - 2*distance_from_root_per_clade[mrca]; | ^ phylogenetics_cpp_routines.cpp:13289:30: note: ‘mrca’ was declared here 13289 | long cladeA, cladeB, mrca; | ^~~~ gcc-15 -I"/home/hornik/tmp/R-d-gcc-15/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 -Wstrict-prototypes -pedantic -mtune=native -c registerDynamicSymbol.c -o registerDynamicSymbol.o g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R-d-gcc-15/lib -Wl,-O1 -o castor.so RcppExports.o STMathExpression.o phylogenetics_cpp_routines.o registerDynamicSymbol.o -L/home/hornik/tmp/R-d-gcc-15/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpWUCfBN/R.INSTALL2316b25212d5fa/castor/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-castor/00new/castor/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 (castor) checking GUniFrac_1.9.tar.gz ... checking chemodiv_0.3.1.tar.gz ... checking LDM_6.0.1.tar.gz ... checking mecoturn_0.3.1.tar.gz ... checking MiRKAT_1.2.3.tar.gz ... checking RPANDA_2.4.tar.gz ... checking microeco_1.15.0.tar.gz ... Depends: Package: GUniFrac Depends: R (>= 3.5.0) Imports: Rcpp (>= 0.12.13), vegan, ggplot2, matrixStats, Matrix, ape, parallel, stats, utils, statmod, rmutil, dirmult, MASS, ggrepel, foreach, modeest, inline, methods LinkingTo: Rcpp Timings: user system elapsed GUniFrac 89.487 7.097 97.72 Results: Check status summary: OK Source packages 1 Reverse depends 6 Check results summary: GUniFrac ... OK rdepends_chemodiv ... OK rdepends_LDM ... OK rdepends_mecoturn ... OK rdepends_microeco ... OK rdepends_MiRKAT ... OK rdepends_RPANDA ... OK