downloading reverse dependencies ‘Rogue’, ‘rwty’, ‘TBRDist’, ‘Ternary’, ‘TreeSearch’, ‘TreeTools’ trying URL 'file:///data/Repositories/CRAN/src/contrib/Rogue_2.1.7.tar.gz' trying URL 'file:///data/Repositories/CRAN/src/contrib/rwty_1.0.3.tar.gz' trying URL 'file:///data/Repositories/CRAN/src/contrib/TBRDist_1.0.3.tar.gz' trying URL 'file:///data/Repositories/CRAN/src/contrib/Ternary_2.3.6.tar.gz' trying URL 'file:///data/Repositories/CRAN/src/contrib/TreeSearch_1.7.0.tar.gz' trying URL 'file:///data/Repositories/CRAN/src/contrib/TreeTools_2.1.0.tar.gz' installing dependencies ‘kdensity’, ‘protoclust’, ‘Quartet’, ‘Rogue’, ‘TBRDist’, ‘TreeDist’, ‘TreeDistData’, ‘TreeSearch’, ‘Umatrix’, ‘vdiffr’ Warning: package ‘TreeDistData’ is not available for this version of R A version of this package for your version of R might be available elsewhere, see the ideas at https://cran.r-project.org/doc/manuals/r-devel/R-admin.html#Installing-packages also installing the dependencies ‘nakagami’, ‘sads’, ‘ttutils’, ‘univariateML’, ‘EQL’, ‘AdaptGauss’ begin installing package ‘nakagami’ begin installing package ‘sads’ begin installing package ‘ttutils’ begin installing package ‘AdaptGauss’ begin installing package ‘protoclust’ begin installing package ‘TreeDist’ begin installing package ‘vdiffr’ * installing *source* package ‘ttutils’ ... ** this is package ‘ttutils’ version ‘1.0-1.1’ ** package ‘ttutils’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (ttutils) begin installing package ‘EQL’ * installing *source* package ‘nakagami’ ... ** this is package ‘nakagami’ version ‘1.1.0’ ** package ‘nakagami’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (nakagami) * installing *source* package ‘protoclust’ ... ** this is package ‘protoclust’ version ‘1.6.4’ ** package ‘protoclust’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmp3BfPXb/R.INSTALL20f998580fd9ee/protoclust/src' gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c hier.c -o hier.o hier.c: In function ‘hier’: hier.c:194:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation] 194 | for(j = 0; j < imerge; j++) | ^~~ hier.c:204:7: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’ 204 | ii = lt(imerge+1,imerge,n); | ^~ hier.c: In function ‘minimaxpoint’: hier.c:442:10: warning: ‘mm’ may be used uninitialized [-Wmaybe-uninitialized] 442 | return mm; | ^~ hier.c:428:7: note: ‘mm’ was declared here 428 | int mm; | ^~ hier.c: In function ‘findNN’: hier.c:346:29: warning: ‘nn’ may be used uninitialized [-Wmaybe-uninitialized] 346 | mincomplete = completelink(dmax, n, clusters[nn], nn, clusters[i], i); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ hier.c:328:7: note: ‘nn’ was declared here 328 | int nn; | ^~ hier.c: In function ‘hier’: hier.c:274:26: warning: ‘imerge’ may be used uninitialized [-Wmaybe-uninitialized] 274 | Cluster *cur = clusters[imerge]; | ^ hier.c:28:20: note: ‘imerge’ was declared here 28 | int i, j, k, ii, imerge, jmerge, reverse; | ^~~~~~ gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c protoclust_init.c -o protoclust_init.o gcc-15 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o protoclust.so hier.o protoclust_init.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmp3BfPXb/R.INSTALL20f998580fd9ee/protoclust/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-protoclust/00new/protoclust/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 (protoclust) * installing *source* package ‘EQL’ ... ** this is package ‘EQL’ version ‘1.0-1’ ** package ‘EQL’ 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 (EQL) * installing *source* package ‘vdiffr’ ... ** this is package ‘vdiffr’ version ‘1.0.9’ ** package ‘vdiffr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmph0ebVU/R.INSTALL20f9a34608b9c1/vdiffr/src' g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/cpp11/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c compare.cpp -o compare.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/cpp11/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c cpp11.cpp -o cpp11.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/cpp11/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c devSVG.cpp -o devSVG.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/cpp11/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c engine_version.cpp -o engine_version.o g++-15 -std=gnu++20 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o vdiffr.so compare.o cpp11.o devSVG.o engine_version.o -lpng -lz -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmph0ebVU/R.INSTALL20f9a34608b9c1/vdiffr/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-vdiffr/00new/vdiffr/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** testing if installed package can be loaded from temporary location ** 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 (vdiffr) * installing *source* package ‘sads’ ... ** this is package ‘sads’ version ‘0.6.5’ ** package ‘sads’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmp17fnIc/R.INSTALL20f99b3f733360/sads/src' gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c gauss_legendre.c -o gauss_legendre.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c init.c -o init.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c volkov.c -o volkov.o gcc-15 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o sads.so gauss_legendre.o init.o volkov.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmp17fnIc/R.INSTALL20f99b3f733360/sads/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-sads/00new/sads/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (sads) begin installing package ‘univariateML’ * installing *source* package ‘AdaptGauss’ ... ** this is package ‘AdaptGauss’ version ‘1.6’ ** package ‘AdaptGauss’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpxnlpbM/R.INSTALL20f99f2e73c673/AdaptGauss/src' g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c meanC.cpp -o meanC.o g++-15 -std=gnu++20 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o AdaptGauss.so RcppExports.o meanC.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpxnlpbM/R.INSTALL20f99f2e73c673/AdaptGauss/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-AdaptGauss/00new/AdaptGauss/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 (AdaptGauss) begin installing package ‘Umatrix’ * installing *source* package ‘univariateML’ ... ** this is package ‘univariateML’ version ‘1.5.0’ ** package ‘univariateML’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (univariateML) begin installing package ‘kdensity’ * installing *source* package ‘kdensity’ ... ** this is package ‘kdensity’ version ‘1.1.1’ ** package ‘kdensity’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (kdensity) * installing *source* package ‘Umatrix’ ... ** this is package ‘Umatrix’ version ‘4.0.2’ ** package ‘Umatrix’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-15 (Debian 15.2.0-12) 15.2.0’ using C++ compiler: ‘g++-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpXtQUOy/R.INSTALL20fbacbbf3c58/Umatrix/src' g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c addRowWiseC.cpp -o addRowWiseC.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bestmatchC.cpp -o bestmatchC.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bestmatchesC.cpp -o bestmatchesC.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c esomTrainedWeightVectorsConeC.cpp -o esomTrainedWeightVectorsConeC.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c esomTrainedWeightVectorsGaussC.cpp -o esomTrainedWeightVectorsGaussC.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c esomTrainedWeightVectorsMexicanHatC.cpp -o esomTrainedWeightVectorsMexicanHatC.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c registerDynamicSymbol.c -o registerDynamicSymbol.o g++-15 -std=gnu++20 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o Umatrix.so RcppExports.o addRowWiseC.o bestmatchC.o bestmatchesC.o esomTrainedWeightVectorsConeC.o esomTrainedWeightVectorsGaussC.o esomTrainedWeightVectorsMexicanHatC.o registerDynamicSymbol.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpXtQUOy/R.INSTALL20fbacbbf3c58/Umatrix/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-Umatrix/00new/Umatrix/libs ** 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 ** 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 (Umatrix) * installing *source* package ‘TreeDist’ ... ** this is package ‘TreeDist’ version ‘2.12.0’ ** using staged installation ** libs specified C++17 using C++ compiler: ‘g++-15 (Debian 15.2.0-12) 15.2.0’ using C++17 make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpI4i9qv/R.INSTALL20f9a118056347/TreeDist/src' g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/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/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c binary_entropy_counts.cpp -o binary_entropy_counts.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c day_1985.cpp -o day_1985.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c hmi.cpp -o hmi.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c hpart.cpp -o hpart.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c hpart_relabel.cpp -o hpart_relabel.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c lap.cpp -o lap.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c mast.cpp -o mast.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c nni_distance.cpp -o nni_distance.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c path_vector.cpp -o path_vector.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c reduce_tree.cpp -o reduce_tree.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c spr.cpp -o spr.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c spr_lookup.cpp -o spr_lookup.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tree_distance_functions.cpp -o tree_distance_functions.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c tree_distances.cpp -o tree_distances.o g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o TreeDist.so RcppExports.o binary_entropy_counts.o day_1985.o hmi.o hpart.o hpart_relabel.o lap.o mast.o nni_distance.o path_vector.o reduce_tree.o spr.o spr_lookup.o tree_distance_functions.o tree_distances.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpI4i9qv/R.INSTALL20f9a118056347/TreeDist/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-TreeDist/00new/TreeDist/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** 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 (TreeDist) begin installing package ‘Quartet’ begin installing package ‘Rogue’ begin installing package ‘TBRDist’ * installing *source* package ‘Rogue’ ... ** this is package ‘Rogue’ version ‘2.1.7’ ** package ‘Rogue’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpYz0tFY/R.INSTALL20fccf7138ead4/Rogue/src' gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c graph_geodesic.c -o graph_geodesic.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/Array.c -o rnr/Array.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/BitVector.c -o rnr/BitVector.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/Dropset.c -o rnr/Dropset.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/HashTable.c -o rnr/HashTable.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/List.c -o rnr/List.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/Node.c -o rnr/Node.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/ProfileElem.c -o rnr/ProfileElem.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/RogueNaRok.c -o rnr/RogueNaRok.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/Tree.c -o rnr/Tree.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/common.c -o rnr/common.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/legacy.c -o rnr/legacy.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c rnr/newFunctions.c -o rnr/newFunctions.o gcc-15 -I"/home/hornik/tmp/R/include" -DNDEBUG -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c Rogue_init.c -o Rogue_init.o gcc-15 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o Rogue.so graph_geodesic.o rnr/Array.o rnr/BitVector.o rnr/Dropset.o rnr/HashTable.o rnr/List.o rnr/Node.o rnr/ProfileElem.o rnr/RogueNaRok.o rnr/Tree.o rnr/common.o rnr/legacy.o rnr/newFunctions.o Rogue_init.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpYz0tFY/R.INSTALL20fccf7138ead4/Rogue/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-Rogue/00new/Rogue/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** 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 (Rogue) begin installing package ‘TreeSearch’ * installing *source* package ‘TBRDist’ ... ** this is package ‘TBRDist’ version ‘1.0.3’ ** package ‘TBRDist’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmp4Qxiq6/R.INSTALL20fcd357974f25/TBRDist/src' g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c uspr.cpp -o uspr.o In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/scoped_ptr.hpp:13, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/adjacency_list.hpp:22, from uspr/tbr.h:44, from uspr.cpp:18: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 63 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/15/memory:80, from uspr.cpp:12: /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:22, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/adjacency_list.hpp:27: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:598: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 294 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | template class auto_ptr; | ^~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/15/bits/unique_ptr.h:58:28: note: declared here 58 | 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/property_map/property_map.hpp:19: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:21, from uspr/tbr.h:45: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:31, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:20: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/int.hpp:20, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/mpl/if.hpp:19, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_traits.hpp:17, from /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/adjacency_list.hpp:24: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::odd_components_counter]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 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_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 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_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 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_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 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_, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 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_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ 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_ >, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 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_, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /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, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘constexpr boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, int, int&> > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map >::non_odd_vertex >, vec_adj_list_vertex_id_map, int, int&> > >; P = vec_adj_list_vertex_id_map; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map]’ 779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ 807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 808 | g, mate, vm); | ~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map]’ 815 | return matching< Graph, MateMap, VertexIndexMap, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 816 | edmonds_augmenting_path_finder, extra_greedy_matching, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 817 | maximum_cardinality_matching_verifier >(g, mate, vm); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list; MateMap = long unsigned int*]’ 824 | return checked_edmonds_maximum_cardinality_matching( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 825 | g, mate, get(vertex_index, g)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ uspr/tbr.h:2384:68: required from here 2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++-15 -std=gnu++20 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o TBRDist.so RcppExports.o uspr.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmp4Qxiq6/R.INSTALL20fcd357974f25/TBRDist/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-TBRDist/00new/TBRDist/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (TBRDist) * installing *source* package ‘TreeSearch’ ... ** this is package ‘TreeSearch’ version ‘1.7.0’ ** package ‘TreeSearch’ successfully unpacked and MD5 sums checked ** using staged installation ** libs specified C++17 using C compiler: ‘gcc-15 (Debian 15.2.0-12) 15.2.0’ using C++ compiler: ‘g++-15 (Debian 15.2.0-12) 15.2.0’ using C++17 make[1]: Entering directory '/home/hornik/tmp/scratch/Rtmpg2woQW/R.INSTALL20fd7b711ab7c8/TreeSearch/src' gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c RMorphy.c -o RMorphy.o gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c RMorphyUtils.c -o RMorphyUtils.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/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 gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c TreeSearch-init.c -o TreeSearch-init.o gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c fitch.c -o fitch.o gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c morphy.c -o morphy.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c morphy_score.cpp -o morphy_score.o gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c mpl.c -o mpl.o g++-15 -std=gnu++17 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c rearrange.cpp -o rearrange.o gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c statedata.c -o statedata.o gcc-15 -I"/home/hornik/tmp/R/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/TreeTools/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -Wstrict-prototypes -pedantic -mtune=native -c wagner.c -o wagner.o g++-15 -std=gnu++17 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o TreeSearch.so RMorphy.o RMorphyUtils.o RcppExports.o TreeSearch-init.o fitch.o morphy.o morphy_score.o mpl.o rearrange.o statedata.o wagner.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/Rtmpg2woQW/R.INSTALL20fd7b711ab7c8/TreeSearch/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-TreeSearch/00new/TreeSearch/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** 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 (TreeSearch) * installing *source* package ‘Quartet’ ... ** this is package ‘Quartet’ version ‘1.2.7’ ** package ‘Quartet’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-15 (Debian 15.2.0-12) 15.2.0’ make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpyFBFnt/R.INSTALL20fcd159d897a4/Quartet/src' g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c AbstractDistanceCalculator.cpp -o AbstractDistanceCalculator.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c AllQuartets.cpp -o AllQuartets.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c EdgeParser.cpp -o EdgeParser.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDT.cpp -o HDT.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDTCountingCCToC.cpp -o HDTCountingCCToC.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDTCountingCTransform.cpp -o HDTCountingCTransform.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDTCountingG.cpp -o HDTCountingG.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDTCountingIGToC.cpp -o HDTCountingIGToC.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDTCountingLeaf.cpp -o HDTCountingLeaf.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDTFactory.cpp -o HDTFactory.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c HDTListUtils.cpp -o HDTListUtils.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c NewickParser.cpp -o NewickParser.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c QuartetDistanceCalculator.cpp -o QuartetDistanceCalculator.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RootedTree.cpp -o RootedTree.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RootedTreeFactory.cpp -o RootedTreeFactory.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c TripletDistanceCalculator.cpp -o TripletDistanceCalculator.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c int_stuff.cpp -o int_stuff.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c rQuartetDist.cpp -o rQuartetDist.o g++-15 -std=gnu++20 -I"/home/hornik/tmp/R/include" -DNDEBUG -I'/home/hornik/lib/R/Library/4.6/x86_64-linux-gnu/Rcpp/include' -I/usr/local/include -DUSE_TYPE_CHECKING_STRICT -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c rTripletDist.cpp -o rTripletDist.o g++-15 -std=gnu++20 -shared -L/home/hornik/tmp/R/lib -Wl,-O1 -o Quartet.so AbstractDistanceCalculator.o AllQuartets.o EdgeParser.o HDT.o HDTCountingCCToC.o HDTCountingCTransform.o HDTCountingG.o HDTCountingIGToC.o HDTCountingLeaf.o HDTFactory.o HDTListUtils.o NewickParser.o QuartetDistanceCalculator.o RcppExports.o RootedTree.o RootedTreeFactory.o TripletDistanceCalculator.o int_stuff.o rQuartetDist.o rTripletDist.o -L/home/hornik/tmp/R/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpyFBFnt/R.INSTALL20fcd159d897a4/Quartet/src' installing to /home/hornik/tmp/CRAN_recheck/Library/00LOCK-Quartet/00new/Quartet/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (Quartet) checking TreeDist_2.12.0.tar.gz ... checking Rogue_2.1.7.tar.gz ... checking rwty_1.0.3.tar.gz ... checking TBRDist_1.0.3.tar.gz ... checking Ternary_2.3.6.tar.gz ... checking TreeSearch_1.7.0.tar.gz ... checking TreeTools_2.1.0.tar.gz ... Depends: Package: TreeDist Depends: R (>= 4.0), stats, Imports: ape (>= 5.0), cli (>= 3.0), colorspace, Rdpack (>= 0.7), shiny, shinyjs, TreeTools (>= 2.1.0), LinkingTo: Rcpp, TreeTools (>= 2.1.0), Timings: user system elapsed TreeDist 146.255 11.482 162.779 Results: Check status summary: OK Source packages 1 Reverse depends 6 Check results summary: TreeDist ... OK rdepends_Rogue ... OK rdepends_rwty ... OK rdepends_TBRDist ... OK rdepends_Ternary ... OK rdepends_TreeSearch ... OK rdepends_TreeTools ... OK Check results changes: Package: Rogue Check: package dependencies Old result: ERROR New result: OK Package: rwty Check: package dependencies Old result: ERROR New result: OK Package: TBRDist Check: package dependencies Old result: ERROR New result: OK Package: Ternary Check: package dependencies Old result: ERROR New result: OK Package: TreeSearch Check: package dependencies Old result: ERROR New result: OK